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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 17:55:43,807 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 17:55:43,890 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 17:55:43,898 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 17:55:43,898 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 17:55:43,934 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 17:55:43,935 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 17:55:43,936 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 17:55:43,936 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 17:55:43,940 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 17:55:43,940 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 17:55:43,941 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 17:55:43,941 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 17:55:43,942 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 17:55:43,942 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 17:55:43,943 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 17:55:43,943 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 17:55:43,943 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 17:55:43,943 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 17:55:43,944 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 17:55:43,944 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 17:55:43,944 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 17:55:43,945 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 17:55:43,945 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 17:55:43,945 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 17:55:43,945 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 17:55:43,946 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 17:55:43,946 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 17:55:43,946 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 17:55:43,947 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 17:55:43,947 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 17:55:43,948 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 17:55:43,948 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:55:43,948 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 17:55:43,948 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 17:55:43,949 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 17:55:43,949 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 17:55:43,949 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 17:55:43,949 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 17:55:43,949 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 17:55:43,950 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 17:55:43,950 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 17:55:43,950 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 17:55:43,950 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-04 17:55:44,194 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 17:55:44,221 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 17:55:44,223 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 17:55:44,224 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 17:55:44,224 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 17:55:44,225 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i
[2024-06-04 17:55:45,479 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 17:55:45,709 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 17:55:45,709 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i
[2024-06-04 17:55:45,726 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d72716/5fe9b9902ce340dbba21c91385601a76/FLAG5e7430fed
[2024-06-04 17:55:45,739 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d72716/5fe9b9902ce340dbba21c91385601a76
[2024-06-04 17:55:45,741 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 17:55:45,742 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 17:55:45,742 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/safe004_power.opt_pso.opt_rmo.opt.yml/witness.yml
[2024-06-04 17:55:45,931 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 17:55:45,932 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 17:55:45,933 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 17:55:45,933 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 17:55:45,938 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 17:55:45,939 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:55:45" (1/2) ...
[2024-06-04 17:55:45,940 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e2fc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:55:45, skipping insertion in model container
[2024-06-04 17:55:45,940 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:55:45" (1/2) ...
[2024-06-04 17:55:45,941 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@311354ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:55:45, skipping insertion in model container
[2024-06-04 17:55:45,941 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:55:45" (2/2) ...
[2024-06-04 17:55:45,942 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e2fc2c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:45, skipping insertion in model container
[2024-06-04 17:55:45,942 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:55:45" (2/2) ...
[2024-06-04 17:55:45,942 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 17:55:46,078 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 17:55:46,080 INFO  L97    edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-04 17:55:46,081 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-04 17:55:46,081 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-04 17:55:46,082 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 17:55:46,082 INFO  L106   edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1;
[2024-06-04 17:55:46,147 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 17:55:46,472 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:55:46,481 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 17:55:46,889 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:55:46,923 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 17:55:46,924 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46 WrapperNode
[2024-06-04 17:55:46,924 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 17:55:46,925 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 17:55:46,925 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 17:55:46,925 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 17:55:46,931 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 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:46,973 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 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,175 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-04 17:55:47,175 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 17:55:47,177 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 17:55:47,177 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 17:55:47,177 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 17:55:47,187 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,188 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,239 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,296 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-04 17:55:47,296 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,296 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,358 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,361 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,372 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,378 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,468 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 17:55:47,470 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 17:55:47,470 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 17:55:47,470 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 17:55:47,471 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (1/1) ...
[2024-06-04 17:55:47,476 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:55:47,484 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 17:55:47,498 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-04 17:55:47,510 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-04 17:55:47,539 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 17:55:47,539 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 17:55:47,539 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 17:55:47,540 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 17:55:47,540 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 17:55:47,540 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 17:55:47,540 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 17:55:47,541 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 17:55:47,541 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 17:55:47,541 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 17:55:47,541 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 17:55:47,541 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 17:55:47,543 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 17:55:47,708 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 17:55:47,710 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 17:55:48,972 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 17:55:48,974 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 17:55:49,279 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 17:55:49,279 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 17:55:49,280 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:55:49 BoogieIcfgContainer
[2024-06-04 17:55:49,280 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 17:55:49,283 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 17:55:49,283 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 17:55:49,286 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 17:55:49,286 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:55:45" (1/4) ...
[2024-06-04 17:55:49,287 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b77221f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:55:49, skipping insertion in model container
[2024-06-04 17:55:49,287 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:55:45" (2/4) ...
[2024-06-04 17:55:49,288 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b77221f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:55:49, skipping insertion in model container
[2024-06-04 17:55:49,288 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:55:46" (3/4) ...
[2024-06-04 17:55:49,289 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b77221f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:55:49, skipping insertion in model container
[2024-06-04 17:55:49,289 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:55:49" (4/4) ...
[2024-06-04 17:55:49,290 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i
[2024-06-04 17:55:49,306 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 17:55:49,307 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 17:55:49,307 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 17:55:49,421 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 17:55:49,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-04 17:55:49,545 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-04 17:55:49,545 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:55:49,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 17:55:49,548 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-04 17:55:49,551 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-04 17:55:49,565 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 17:55:49,573 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;@42469e00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 17:55:49,573 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 17:55:49,583 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 17:55:49,584 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 17:55:49,584 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:55:49,584 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:55:49,585 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 17:55:49,585 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-04 17:55:49,591 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:55:49,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times
[2024-06-04 17:55:49,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:55:49,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571046490]
[2024-06-04 17:55:49,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:55:49,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:55:50,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:55:55,325 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-04 17:55:55,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:55:55,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571046490]
[2024-06-04 17:55:55,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571046490] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:55:55,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:55:55,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 17:55:55,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048060254]
[2024-06-04 17:55:55,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:55:55,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 17:55:55,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:55:55,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 17:55:55,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 17:55:55,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-04 17:55:55,446 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 12.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-04 17:55:55,446 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:55:55,446 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-04 17:55:55,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:55:56,424 INFO  L124   PetriNetUnfolderBase]: 1152/1756 cut-off events.
[2024-06-04 17:55:56,424 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-04 17:55:56,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1756 events. 1152/1756 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8194 event pairs, 693 based on Foata normal form. 2/1710 useless extension candidates. Maximal degree in co-relation 3583. Up to 1738 conditions per place. 
[2024-06-04 17:55:56,442 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 17:55:56,442 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 177 flow
[2024-06-04 17:55:56,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 17:55:56,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 17:55:56,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-06-04 17:55:56,454 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5772357723577236
[2024-06-04 17:55:56,456 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 71 transitions.
[2024-06-04 17:55:56,457 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 177 flow
[2024-06-04 17:55:56,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 17:55:56,463 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-04 17:55:56,464 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-04 17:55:56,467 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-04 17:55:56,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-04 17:55:56,468 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-04 17:55:56,468 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:55:56,468 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:55:56,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 17:55:56,469 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-04 17:55:56,470 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:55:56,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 588573823, now seen corresponding path program 1 times
[2024-06-04 17:55:56,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:55:56,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352059607]
[2024-06-04 17:55:56,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:55:56,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:55:56,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:00,735 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-04 17:56:00,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:00,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352059607]
[2024-06-04 17:56:00,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352059607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:00,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:00,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 17:56:00,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662564761]
[2024-06-04 17:56:00,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:00,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 17:56:00,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:00,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 17:56:00,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 17:56:00,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 17:56:00,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:00,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:00,835 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 17:56:00,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:01,912 INFO  L124   PetriNetUnfolderBase]: 1644/2457 cut-off events.
[2024-06-04 17:56:01,912 INFO  L125   PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES.
[2024-06-04 17:56:01,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 2457 events. 1644/2457 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11113 event pairs, 1035 based on Foata normal form. 3/2458 useless extension candidates. Maximal degree in co-relation 5625. Up to 2429 conditions per place. 
[2024-06-04 17:56:01,929 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-04 17:56:01,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 260 flow
[2024-06-04 17:56:01,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 17:56:01,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 17:56:01,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions.
[2024-06-04 17:56:01,933 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-04 17:56:01,933 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 84 transitions.
[2024-06-04 17:56:01,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 260 flow
[2024-06-04 17:56:01,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 17:56:01,938 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 152 flow
[2024-06-04 17:56:01,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2024-06-04 17:56:01,939 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-04 17:56:01,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 152 flow
[2024-06-04 17:56:01,940 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:01,940 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:01,941 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:01,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 17:56:01,943 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-04 17:56:01,944 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:01,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times
[2024-06-04 17:56:01,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:01,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090146823]
[2024-06-04 17:56:01,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:01,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:02,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:05,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:56:05,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:05,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090146823]
[2024-06-04 17:56:05,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090146823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:05,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:05,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 17:56:05,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738277153]
[2024-06-04 17:56:05,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:05,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 17:56:05,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:05,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 17:56:05,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-04 17:56:06,072 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 17:56:06,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 152 flow. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:06,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:06,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 17:56:06,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:07,088 INFO  L124   PetriNetUnfolderBase]: 1632/2439 cut-off events.
[2024-06-04 17:56:07,088 INFO  L125   PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES.
[2024-06-04 17:56:07,093 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 2439 events. 1632/2439 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11020 event pairs, 743 based on Foata normal form. 6/2443 useless extension candidates. Maximal degree in co-relation 6197. Up to 2381 conditions per place. 
[2024-06-04 17:56:07,105 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 10 changer transitions 0/66 dead transitions.
[2024-06-04 17:56:07,105 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 346 flow
[2024-06-04 17:56:07,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:56:07,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:56:07,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions.
[2024-06-04 17:56:07,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5024390243902439
[2024-06-04 17:56:07,108 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 152 flow. Second operand 5 states and 103 transitions.
[2024-06-04 17:56:07,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 346 flow
[2024-06-04 17:56:07,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 344 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-04 17:56:07,111 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 198 flow
[2024-06-04 17:56:07,112 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-06-04 17:56:07,112 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-06-04 17:56:07,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 198 flow
[2024-06-04 17:56:07,113 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:07,113 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:07,113 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:07,113 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 17:56:07,113 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-04 17:56:07,114 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:07,114 INFO  L85        PathProgramCache]: Analyzing trace with hash 2146976690, now seen corresponding path program 1 times
[2024-06-04 17:56:07,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:07,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493599940]
[2024-06-04 17:56:07,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:07,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:07,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:11,934 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-04 17:56:11,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:11,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493599940]
[2024-06-04 17:56:11,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493599940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:11,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:11,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:56:11,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519941365]
[2024-06-04 17:56:11,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:11,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:56:11,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:11,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:56:11,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:56:12,035 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 17:56:12,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 198 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:12,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:12,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 17:56:12,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:13,081 INFO  L124   PetriNetUnfolderBase]: 1623/2424 cut-off events.
[2024-06-04 17:56:13,081 INFO  L125   PetriNetUnfolderBase]: For 2223/2223 co-relation queries the response was YES.
[2024-06-04 17:56:13,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 2424 events. 1623/2424 cut-off events. For 2223/2223 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10903 event pairs, 579 based on Foata normal form. 6/2428 useless extension candidates. Maximal degree in co-relation 6761. Up to 2336 conditions per place. 
[2024-06-04 17:56:13,098 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-04 17:56:13,098 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 410 flow
[2024-06-04 17:56:13,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:56:13,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:56:13,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-04 17:56:13,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-04 17:56:13,103 INFO  L175             Difference]: Start difference. First operand has 51 places, 44 transitions, 198 flow. Second operand 6 states and 117 transitions.
[2024-06-04 17:56:13,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 410 flow
[2024-06-04 17:56:13,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 388 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-04 17:56:13,109 INFO  L231             Difference]: Finished difference. Result has 53 places, 45 transitions, 217 flow
[2024-06-04 17:56:13,109 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=45}
[2024-06-04 17:56:13,111 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2024-06-04 17:56:13,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 217 flow
[2024-06-04 17:56:13,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:13,111 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:13,111 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:13,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 17:56:13,112 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:56:13,112 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:13,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906018500, now seen corresponding path program 1 times
[2024-06-04 17:56:13,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:13,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869193718]
[2024-06-04 17:56:13,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:13,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:13,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:19,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:56:19,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:19,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869193718]
[2024-06-04 17:56:19,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869193718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:19,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:19,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:56:19,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240946329]
[2024-06-04 17:56:19,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:19,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:56:19,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:19,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:56:19,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:56:19,381 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-04 17:56:19,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 217 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-04 17:56:19,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:19,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-04 17:56:19,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:20,338 INFO  L124   PetriNetUnfolderBase]: 1237/1933 cut-off events.
[2024-06-04 17:56:20,338 INFO  L125   PetriNetUnfolderBase]: For 2895/2931 co-relation queries the response was YES.
[2024-06-04 17:56:20,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 1933 events. 1237/1933 cut-off events. For 2895/2931 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9278 event pairs, 586 based on Foata normal form. 4/1867 useless extension candidates. Maximal degree in co-relation 5670. Up to 1810 conditions per place. 
[2024-06-04 17:56:20,351 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 10 changer transitions 0/61 dead transitions.
[2024-06-04 17:56:20,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 363 flow
[2024-06-04 17:56:20,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:56:20,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:56:20,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-04 17:56:20,353 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44878048780487806
[2024-06-04 17:56:20,353 INFO  L175             Difference]: Start difference. First operand has 53 places, 45 transitions, 217 flow. Second operand 5 states and 92 transitions.
[2024-06-04 17:56:20,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 363 flow
[2024-06-04 17:56:20,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 332 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-04 17:56:20,357 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 231 flow
[2024-06-04 17:56:20,357 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-06-04 17:56:20,358 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2024-06-04 17:56:20,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 231 flow
[2024-06-04 17:56:20,359 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-04 17:56:20,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:20,359 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:20,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 17:56:20,360 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-04 17:56:20,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:20,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081397346, now seen corresponding path program 1 times
[2024-06-04 17:56:20,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:20,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806863920]
[2024-06-04 17:56:20,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:20,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:20,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:26,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:56:26,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:26,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806863920]
[2024-06-04 17:56:26,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806863920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:26,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:26,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:56:26,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284811141]
[2024-06-04 17:56:26,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:26,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:56:26,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:26,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:56:26,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:56:26,991 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:56:26,991 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 231 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:26,991 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:26,991 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:56:26,991 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:27,982 INFO  L124   PetriNetUnfolderBase]: 1618/2421 cut-off events.
[2024-06-04 17:56:27,982 INFO  L125   PetriNetUnfolderBase]: For 4508/4518 co-relation queries the response was YES.
[2024-06-04 17:56:27,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7698 conditions, 2421 events. 1618/2421 cut-off events. For 4508/4518 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10878 event pairs, 734 based on Foata normal form. 12/2430 useless extension candidates. Maximal degree in co-relation 7674. Up to 2335 conditions per place. 
[2024-06-04 17:56:27,995 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-04 17:56:27,995 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 487 flow
[2024-06-04 17:56:27,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:56:27,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:56:27,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-04 17:56:27,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 17:56:27,996 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 231 flow. Second operand 6 states and 102 transitions.
[2024-06-04 17:56:27,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 487 flow
[2024-06-04 17:56:27,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 464 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-04 17:56:28,000 INFO  L231             Difference]: Finished difference. Result has 58 places, 57 transitions, 316 flow
[2024-06-04 17:56:28,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=57}
[2024-06-04 17:56:28,001 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2024-06-04 17:56:28,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 316 flow
[2024-06-04 17:56:28,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:28,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:28,002 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:28,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 17:56:28,002 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-04 17:56:28,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:28,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 2129436313, now seen corresponding path program 1 times
[2024-06-04 17:56:28,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:28,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050269841]
[2024-06-04 17:56:28,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:28,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:28,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:33,439 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-04 17:56:33,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:33,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050269841]
[2024-06-04 17:56:33,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050269841] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:33,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:33,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:56:33,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358896773]
[2024-06-04 17:56:33,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:33,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:56:33,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:33,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:56:33,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:56:33,532 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:56:33,533 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 316 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:33,533 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:33,533 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:56:33,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:34,386 INFO  L124   PetriNetUnfolderBase]: 1641/2455 cut-off events.
[2024-06-04 17:56:34,387 INFO  L125   PetriNetUnfolderBase]: For 6463/6463 co-relation queries the response was YES.
[2024-06-04 17:56:34,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 2455 events. 1641/2455 cut-off events. For 6463/6463 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11004 event pairs, 758 based on Foata normal form. 2/2455 useless extension candidates. Maximal degree in co-relation 8687. Up to 2411 conditions per place. 
[2024-06-04 17:56:34,402 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 16 changer transitions 0/86 dead transitions.
[2024-06-04 17:56:34,402 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 592 flow
[2024-06-04 17:56:34,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:56:34,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:56:34,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-04 17:56:34,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-04 17:56:34,405 INFO  L175             Difference]: Start difference. First operand has 58 places, 57 transitions, 316 flow. Second operand 7 states and 114 transitions.
[2024-06-04 17:56:34,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 592 flow
[2024-06-04 17:56:34,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 563 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-04 17:56:34,413 INFO  L231             Difference]: Finished difference. Result has 64 places, 65 transitions, 397 flow
[2024-06-04 17:56:34,413 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=64, PETRI_TRANSITIONS=65}
[2024-06-04 17:56:34,414 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places.
[2024-06-04 17:56:34,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 397 flow
[2024-06-04 17:56:34,414 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:34,414 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:34,414 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:34,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 17:56:34,415 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-04 17:56:34,415 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:34,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 830700505, now seen corresponding path program 2 times
[2024-06-04 17:56:34,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:34,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804942505]
[2024-06-04 17:56:34,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:34,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:34,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:39,811 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-04 17:56:39,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:39,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804942505]
[2024-06-04 17:56:39,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804942505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:39,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:39,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:56:39,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323218]
[2024-06-04 17:56:39,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:39,813 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:56:39,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:39,814 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:56:39,814 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:56:39,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:56:39,954 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 397 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:39,954 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:39,954 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:56:39,954 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:40,820 INFO  L124   PetriNetUnfolderBase]: 1697/2534 cut-off events.
[2024-06-04 17:56:40,820 INFO  L125   PetriNetUnfolderBase]: For 8260/8260 co-relation queries the response was YES.
[2024-06-04 17:56:40,825 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9283 conditions, 2534 events. 1697/2534 cut-off events. For 8260/8260 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11309 event pairs, 757 based on Foata normal form. 5/2537 useless extension candidates. Maximal degree in co-relation 9254. Up to 2445 conditions per place. 
[2024-06-04 17:56:40,834 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 67 selfloop transitions, 28 changer transitions 0/98 dead transitions.
[2024-06-04 17:56:40,834 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 737 flow
[2024-06-04 17:56:40,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:56:40,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:56:40,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-04 17:56:40,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44308943089430897
[2024-06-04 17:56:40,841 INFO  L175             Difference]: Start difference. First operand has 64 places, 65 transitions, 397 flow. Second operand 6 states and 109 transitions.
[2024-06-04 17:56:40,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 737 flow
[2024-06-04 17:56:40,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 696 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-04 17:56:40,848 INFO  L231             Difference]: Finished difference. Result has 66 places, 77 transitions, 538 flow
[2024-06-04 17:56:40,848 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=66, PETRI_TRANSITIONS=77}
[2024-06-04 17:56:40,849 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-04 17:56:40,849 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 538 flow
[2024-06-04 17:56:40,849 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:40,849 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:40,849 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:40,850 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 17:56:40,850 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-04 17:56:40,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:40,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 836414425, now seen corresponding path program 3 times
[2024-06-04 17:56:40,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:40,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995813509]
[2024-06-04 17:56:40,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:40,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:40,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:46,660 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-04 17:56:46,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:46,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995813509]
[2024-06-04 17:56:46,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995813509] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:46,661 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:46,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:56:46,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851228499]
[2024-06-04 17:56:46,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:46,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:56:46,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:46,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:56:46,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:56:46,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:56:46,761 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 538 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:46,761 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:46,761 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:56:46,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:47,755 INFO  L124   PetriNetUnfolderBase]: 1684/2517 cut-off events.
[2024-06-04 17:56:47,755 INFO  L125   PetriNetUnfolderBase]: For 10576/10589 co-relation queries the response was YES.
[2024-06-04 17:56:47,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10315 conditions, 2517 events. 1684/2517 cut-off events. For 10576/10589 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11311 event pairs, 762 based on Foata normal form. 14/2527 useless extension candidates. Maximal degree in co-relation 10285. Up to 2407 conditions per place. 
[2024-06-04 17:56:47,769 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 24 changer transitions 0/94 dead transitions.
[2024-06-04 17:56:47,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 783 flow
[2024-06-04 17:56:47,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:56:47,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:56:47,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-04 17:56:47,771 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-04 17:56:47,771 INFO  L175             Difference]: Start difference. First operand has 66 places, 77 transitions, 538 flow. Second operand 6 states and 100 transitions.
[2024-06-04 17:56:47,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 783 flow
[2024-06-04 17:56:47,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 737 flow, removed 19 selfloop flow, removed 2 redundant places.
[2024-06-04 17:56:47,786 INFO  L231             Difference]: Finished difference. Result has 71 places, 79 transitions, 583 flow
[2024-06-04 17:56:47,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=583, PETRI_PLACES=71, PETRI_TRANSITIONS=79}
[2024-06-04 17:56:47,786 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places.
[2024-06-04 17:56:47,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 583 flow
[2024-06-04 17:56:47,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:47,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:47,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:47,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 17:56:47,787 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-04 17:56:47,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:47,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 836422361, now seen corresponding path program 1 times
[2024-06-04 17:56:47,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:47,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379452919]
[2024-06-04 17:56:47,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:47,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:47,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:56:53,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-04 17:56:53,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:56:53,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379452919]
[2024-06-04 17:56:53,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379452919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:56:53,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:56:53,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:56:53,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590622364]
[2024-06-04 17:56:53,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:56:53,678 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:56:53,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:56:53,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:56:53,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:56:53,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:56:53,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 583 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:53,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:56:53,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:56:53,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:56:54,606 INFO  L124   PetriNetUnfolderBase]: 1690/2526 cut-off events.
[2024-06-04 17:56:54,606 INFO  L125   PetriNetUnfolderBase]: For 10531/10544 co-relation queries the response was YES.
[2024-06-04 17:56:54,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10433 conditions, 2526 events. 1690/2526 cut-off events. For 10531/10544 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11344 event pairs, 726 based on Foata normal form. 14/2536 useless extension candidates. Maximal degree in co-relation 10400. Up to 2398 conditions per place. 
[2024-06-04 17:56:54,621 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 30 changer transitions 0/102 dead transitions.
[2024-06-04 17:56:54,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 865 flow
[2024-06-04 17:56:54,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:56:54,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:56:54,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-04 17:56:54,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40069686411149824
[2024-06-04 17:56:54,623 INFO  L175             Difference]: Start difference. First operand has 71 places, 79 transitions, 583 flow. Second operand 7 states and 115 transitions.
[2024-06-04 17:56:54,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 865 flow
[2024-06-04 17:56:54,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 829 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:56:54,634 INFO  L231             Difference]: Finished difference. Result has 75 places, 83 transitions, 650 flow
[2024-06-04 17:56:54,635 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=75, PETRI_TRANSITIONS=83}
[2024-06-04 17:56:54,635 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2024-06-04 17:56:54,635 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 650 flow
[2024-06-04 17:56:54,636 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:56:54,636 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:56:54,636 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:56:54,636 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 17:56:54,636 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-04 17:56:54,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:56:54,637 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102396995, now seen corresponding path program 1 times
[2024-06-04 17:56:54,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:56:54,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227134365]
[2024-06-04 17:56:54,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:56:54,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:56:54,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:00,350 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-04 17:57:00,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:00,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227134365]
[2024-06-04 17:57:00,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227134365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:00,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:00,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:57:00,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027736509]
[2024-06-04 17:57:00,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:00,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:57:00,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:00,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:57:00,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:57:00,457 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:00,457 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 650 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:00,457 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:00,457 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:00,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:01,397 INFO  L124   PetriNetUnfolderBase]: 1818/2704 cut-off events.
[2024-06-04 17:57:01,398 INFO  L125   PetriNetUnfolderBase]: For 13879/13879 co-relation queries the response was YES.
[2024-06-04 17:57:01,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11903 conditions, 2704 events. 1818/2704 cut-off events. For 13879/13879 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12181 event pairs, 583 based on Foata normal form. 10/2712 useless extension candidates. Maximal degree in co-relation 11869. Up to 2515 conditions per place. 
[2024-06-04 17:57:01,413 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 93 selfloop transitions, 37 changer transitions 0/133 dead transitions.
[2024-06-04 17:57:01,413 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 1166 flow
[2024-06-04 17:57:01,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:57:01,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:57:01,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-04 17:57:01,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-04 17:57:01,415 INFO  L175             Difference]: Start difference. First operand has 75 places, 83 transitions, 650 flow. Second operand 7 states and 133 transitions.
[2024-06-04 17:57:01,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 1166 flow
[2024-06-04 17:57:01,427 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1093 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-04 17:57:01,430 INFO  L231             Difference]: Finished difference. Result has 79 places, 101 transitions, 837 flow
[2024-06-04 17:57:01,430 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=79, PETRI_TRANSITIONS=101}
[2024-06-04 17:57:01,431 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places.
[2024-06-04 17:57:01,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 101 transitions, 837 flow
[2024-06-04 17:57:01,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:01,431 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:01,431 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:01,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 17:57:01,432 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-04 17:57:01,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:01,432 INFO  L85        PathProgramCache]: Analyzing trace with hash 739556343, now seen corresponding path program 2 times
[2024-06-04 17:57:01,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:01,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237864465]
[2024-06-04 17:57:01,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:01,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:01,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:07,131 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-04 17:57:07,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:07,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237864465]
[2024-06-04 17:57:07,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237864465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:07,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:07,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:57:07,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793313907]
[2024-06-04 17:57:07,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:07,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:57:07,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:07,133 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:57:07,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:57:07,286 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:07,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 101 transitions, 837 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:07,286 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:07,286 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:07,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:08,241 INFO  L124   PetriNetUnfolderBase]: 1856/2759 cut-off events.
[2024-06-04 17:57:08,241 INFO  L125   PetriNetUnfolderBase]: For 18320/18320 co-relation queries the response was YES.
[2024-06-04 17:57:08,247 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13650 conditions, 2759 events. 1856/2759 cut-off events. For 18320/18320 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12442 event pairs, 581 based on Foata normal form. 4/2761 useless extension candidates. Maximal degree in co-relation 13613. Up to 2618 conditions per place. 
[2024-06-04 17:57:08,257 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 104 selfloop transitions, 29 changer transitions 0/136 dead transitions.
[2024-06-04 17:57:08,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1303 flow
[2024-06-04 17:57:08,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:57:08,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:57:08,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-04 17:57:08,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4181184668989547
[2024-06-04 17:57:08,261 INFO  L175             Difference]: Start difference. First operand has 79 places, 101 transitions, 837 flow. Second operand 7 states and 120 transitions.
[2024-06-04 17:57:08,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1303 flow
[2024-06-04 17:57:08,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 136 transitions, 1253 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-04 17:57:08,282 INFO  L231             Difference]: Finished difference. Result has 85 places, 109 transitions, 954 flow
[2024-06-04 17:57:08,282 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=954, PETRI_PLACES=85, PETRI_TRANSITIONS=109}
[2024-06-04 17:57:08,283 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places.
[2024-06-04 17:57:08,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 109 transitions, 954 flow
[2024-06-04 17:57:08,283 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:08,283 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:08,283 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:08,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 17:57:08,284 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-04 17:57:08,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:08,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 159044901, now seen corresponding path program 3 times
[2024-06-04 17:57:08,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:08,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467814530]
[2024-06-04 17:57:08,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:08,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:08,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:13,821 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-04 17:57:13,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:13,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467814530]
[2024-06-04 17:57:13,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467814530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:13,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:13,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:57:13,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668257536]
[2024-06-04 17:57:13,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:13,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:57:13,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:13,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:57:13,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:57:13,961 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:13,961 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 109 transitions, 954 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:13,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:13,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:13,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:14,807 INFO  L124   PetriNetUnfolderBase]: 1928/2870 cut-off events.
[2024-06-04 17:57:14,807 INFO  L125   PetriNetUnfolderBase]: For 22923/22927 co-relation queries the response was YES.
[2024-06-04 17:57:14,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14682 conditions, 2870 events. 1928/2870 cut-off events. For 22923/22927 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13105 event pairs, 530 based on Foata normal form. 16/2881 useless extension candidates. Maximal degree in co-relation 14642. Up to 2449 conditions per place. 
[2024-06-04 17:57:14,822 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 43 changer transitions 0/149 dead transitions.
[2024-06-04 17:57:14,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 149 transitions, 1528 flow
[2024-06-04 17:57:14,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:57:14,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:57:14,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-04 17:57:14,825 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-04 17:57:14,825 INFO  L175             Difference]: Start difference. First operand has 85 places, 109 transitions, 954 flow. Second operand 7 states and 129 transitions.
[2024-06-04 17:57:14,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 149 transitions, 1528 flow
[2024-06-04 17:57:14,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 149 transitions, 1490 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-04 17:57:14,858 INFO  L231             Difference]: Finished difference. Result has 90 places, 121 transitions, 1142 flow
[2024-06-04 17:57:14,858 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1142, PETRI_PLACES=90, PETRI_TRANSITIONS=121}
[2024-06-04 17:57:14,859 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places.
[2024-06-04 17:57:14,859 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 121 transitions, 1142 flow
[2024-06-04 17:57:14,859 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:14,859 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:14,860 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:14,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 17:57:14,860 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:57:14,860 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:14,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 159291165, now seen corresponding path program 1 times
[2024-06-04 17:57:14,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:14,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626179293]
[2024-06-04 17:57:14,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:14,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:14,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:20,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:57:20,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:20,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626179293]
[2024-06-04 17:57:20,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626179293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:20,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:20,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:57:20,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822971666]
[2024-06-04 17:57:20,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:20,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:57:20,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:20,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:57:20,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:57:21,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:21,027 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 121 transitions, 1142 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:21,027 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:21,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:21,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:22,463 INFO  L124   PetriNetUnfolderBase]: 2056/3088 cut-off events.
[2024-06-04 17:57:22,463 INFO  L125   PetriNetUnfolderBase]: For 29258/29262 co-relation queries the response was YES.
[2024-06-04 17:57:22,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16730 conditions, 3088 events. 2056/3088 cut-off events. For 29258/29262 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14483 event pairs, 468 based on Foata normal form. 36/3119 useless extension candidates. Maximal degree in co-relation 16687. Up to 2555 conditions per place. 
[2024-06-04 17:57:22,479 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 114 selfloop transitions, 51 changer transitions 0/168 dead transitions.
[2024-06-04 17:57:22,479 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 168 transitions, 1820 flow
[2024-06-04 17:57:22,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:57:22,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:57:22,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-04 17:57:22,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-04 17:57:22,484 INFO  L175             Difference]: Start difference. First operand has 90 places, 121 transitions, 1142 flow. Second operand 8 states and 148 transitions.
[2024-06-04 17:57:22,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 168 transitions, 1820 flow
[2024-06-04 17:57:22,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 168 transitions, 1746 flow, removed 30 selfloop flow, removed 2 redundant places.
[2024-06-04 17:57:22,521 INFO  L231             Difference]: Finished difference. Result has 99 places, 132 transitions, 1385 flow
[2024-06-04 17:57:22,521 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1385, PETRI_PLACES=99, PETRI_TRANSITIONS=132}
[2024-06-04 17:57:22,523 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places.
[2024-06-04 17:57:22,523 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 132 transitions, 1385 flow
[2024-06-04 17:57:22,523 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:22,523 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:22,523 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:22,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 17:57:22,524 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-04 17:57:22,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:22,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -2131785044, now seen corresponding path program 1 times
[2024-06-04 17:57:22,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:22,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689010887]
[2024-06-04 17:57:22,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:22,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:22,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:29,013 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-04 17:57:29,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:29,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689010887]
[2024-06-04 17:57:29,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689010887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:29,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:29,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:57:29,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340577427]
[2024-06-04 17:57:29,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:29,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:57:29,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:29,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:57:29,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:57:29,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:29,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 132 transitions, 1385 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:29,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:29,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:29,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:30,350 INFO  L124   PetriNetUnfolderBase]: 2113/3171 cut-off events.
[2024-06-04 17:57:30,350 INFO  L125   PetriNetUnfolderBase]: For 34459/34459 co-relation queries the response was YES.
[2024-06-04 17:57:30,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18479 conditions, 3171 events. 2113/3171 cut-off events. For 34459/34459 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14910 event pairs, 548 based on Foata normal form. 2/3171 useless extension candidates. Maximal degree in co-relation 18431. Up to 3053 conditions per place. 
[2024-06-04 17:57:30,370 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 143 selfloop transitions, 30 changer transitions 0/176 dead transitions.
[2024-06-04 17:57:30,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 176 transitions, 1992 flow
[2024-06-04 17:57:30,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:57:30,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:57:30,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-04 17:57:30,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-04 17:57:30,373 INFO  L175             Difference]: Start difference. First operand has 99 places, 132 transitions, 1385 flow. Second operand 8 states and 134 transitions.
[2024-06-04 17:57:30,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 176 transitions, 1992 flow
[2024-06-04 17:57:30,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 176 transitions, 1929 flow, removed 22 selfloop flow, removed 2 redundant places.
[2024-06-04 17:57:30,415 INFO  L231             Difference]: Finished difference. Result has 106 places, 146 transitions, 1584 flow
[2024-06-04 17:57:30,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1584, PETRI_PLACES=106, PETRI_TRANSITIONS=146}
[2024-06-04 17:57:30,416 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places.
[2024-06-04 17:57:30,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 146 transitions, 1584 flow
[2024-06-04 17:57:30,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:30,416 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:30,416 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:30,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 17:57:30,417 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-04 17:57:30,417 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:30,417 INFO  L85        PathProgramCache]: Analyzing trace with hash -1440543034, now seen corresponding path program 2 times
[2024-06-04 17:57:30,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:30,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657444083]
[2024-06-04 17:57:30,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:30,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:30,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:36,696 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-04 17:57:36,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:36,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657444083]
[2024-06-04 17:57:36,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657444083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:36,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:36,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:57:36,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121298063]
[2024-06-04 17:57:36,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:36,697 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:57:36,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:36,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:57:36,698 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:57:36,828 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:36,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 146 transitions, 1584 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:36,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:36,829 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:36,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:37,950 INFO  L124   PetriNetUnfolderBase]: 2108/3163 cut-off events.
[2024-06-04 17:57:37,951 INFO  L125   PetriNetUnfolderBase]: For 36962/36962 co-relation queries the response was YES.
[2024-06-04 17:57:37,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18658 conditions, 3163 events. 2108/3163 cut-off events. For 36962/36962 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14881 event pairs, 545 based on Foata normal form. 2/3163 useless extension candidates. Maximal degree in co-relation 18607. Up to 3019 conditions per place. 
[2024-06-04 17:57:37,967 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 33 changer transitions 0/172 dead transitions.
[2024-06-04 17:57:37,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 172 transitions, 2020 flow
[2024-06-04 17:57:37,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:57:37,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:57:37,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-04 17:57:37,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41114982578397213
[2024-06-04 17:57:37,970 INFO  L175             Difference]: Start difference. First operand has 106 places, 146 transitions, 1584 flow. Second operand 7 states and 118 transitions.
[2024-06-04 17:57:37,970 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 172 transitions, 2020 flow
[2024-06-04 17:57:38,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 172 transitions, 1963 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-04 17:57:38,007 INFO  L231             Difference]: Finished difference. Result has 110 places, 146 transitions, 1613 flow
[2024-06-04 17:57:38,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1613, PETRI_PLACES=110, PETRI_TRANSITIONS=146}
[2024-06-04 17:57:38,008 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places.
[2024-06-04 17:57:38,008 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 146 transitions, 1613 flow
[2024-06-04 17:57:38,008 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:57:38,008 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:38,008 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:38,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 17:57:38,009 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-04 17:57:38,009 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:38,009 INFO  L85        PathProgramCache]: Analyzing trace with hash -564402571, now seen corresponding path program 1 times
[2024-06-04 17:57:38,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:38,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771314130]
[2024-06-04 17:57:38,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:38,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:38,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:43,886 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-04 17:57:43,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:43,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771314130]
[2024-06-04 17:57:43,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771314130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:43,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:43,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:57:43,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109857480]
[2024-06-04 17:57:43,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:43,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:57:43,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:43,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:57:43,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:57:44,045 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:44,046 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 146 transitions, 1613 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:57:44,046 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:44,046 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:44,046 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:45,089 INFO  L124   PetriNetUnfolderBase]: 2130/3200 cut-off events.
[2024-06-04 17:57:45,089 INFO  L125   PetriNetUnfolderBase]: For 41724/41747 co-relation queries the response was YES.
[2024-06-04 17:57:45,099 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19143 conditions, 3200 events. 2130/3200 cut-off events. For 41724/41747 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15139 event pairs, 549 based on Foata normal form. 22/3216 useless extension candidates. Maximal degree in co-relation 19091. Up to 3036 conditions per place. 
[2024-06-04 17:57:45,110 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 139 selfloop transitions, 31 changer transitions 0/173 dead transitions.
[2024-06-04 17:57:45,110 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 173 transitions, 2079 flow
[2024-06-04 17:57:45,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:57:45,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:57:45,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 17:57:45,111 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-04 17:57:45,111 INFO  L175             Difference]: Start difference. First operand has 110 places, 146 transitions, 1613 flow. Second operand 7 states and 117 transitions.
[2024-06-04 17:57:45,111 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 173 transitions, 2079 flow
[2024-06-04 17:57:45,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 173 transitions, 2019 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-04 17:57:45,149 INFO  L231             Difference]: Finished difference. Result has 113 places, 150 transitions, 1684 flow
[2024-06-04 17:57:45,149 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1684, PETRI_PLACES=113, PETRI_TRANSITIONS=150}
[2024-06-04 17:57:45,149 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places.
[2024-06-04 17:57:45,149 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 150 transitions, 1684 flow
[2024-06-04 17:57:45,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:57:45,150 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:45,150 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:45,150 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 17:57:45,150 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-04 17:57:45,151 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:45,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -181710765, now seen corresponding path program 2 times
[2024-06-04 17:57:45,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:45,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135482085]
[2024-06-04 17:57:45,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:45,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:45,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:51,166 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-04 17:57:51,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:51,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135482085]
[2024-06-04 17:57:51,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135482085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:51,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:51,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:57:51,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123444845]
[2024-06-04 17:57:51,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:51,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:57:51,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:51,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:57:51,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:57:51,278 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:51,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 150 transitions, 1684 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:57:51,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:51,278 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:51,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:52,441 INFO  L124   PetriNetUnfolderBase]: 2168/3255 cut-off events.
[2024-06-04 17:57:52,441 INFO  L125   PetriNetUnfolderBase]: For 43080/43099 co-relation queries the response was YES.
[2024-06-04 17:57:52,451 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19604 conditions, 3255 events. 2168/3255 cut-off events. For 43080/43099 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15375 event pairs, 554 based on Foata normal form. 12/3261 useless extension candidates. Maximal degree in co-relation 19550. Up to 2703 conditions per place. 
[2024-06-04 17:57:52,460 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 68 changer transitions 0/182 dead transitions.
[2024-06-04 17:57:52,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 182 transitions, 2342 flow
[2024-06-04 17:57:52,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:57:52,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:57:52,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 17:57:52,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 17:57:52,463 INFO  L175             Difference]: Start difference. First operand has 113 places, 150 transitions, 1684 flow. Second operand 7 states and 126 transitions.
[2024-06-04 17:57:52,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 182 transitions, 2342 flow
[2024-06-04 17:57:52,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 182 transitions, 2302 flow, removed 8 selfloop flow, removed 2 redundant places.
[2024-06-04 17:57:52,508 INFO  L231             Difference]: Finished difference. Result has 118 places, 156 transitions, 1875 flow
[2024-06-04 17:57:52,509 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1875, PETRI_PLACES=118, PETRI_TRANSITIONS=156}
[2024-06-04 17:57:52,509 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places.
[2024-06-04 17:57:52,509 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 156 transitions, 1875 flow
[2024-06-04 17:57:52,509 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:57:52,510 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:52,510 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:52,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 17:57:52,510 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-04 17:57:52,510 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:52,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 1513260605, now seen corresponding path program 3 times
[2024-06-04 17:57:52,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:52,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716382301]
[2024-06-04 17:57:52,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:52,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:52,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:57:58,369 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-04 17:57:58,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:57:58,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716382301]
[2024-06-04 17:57:58,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716382301] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:57:58,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:57:58,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:57:58,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440347286]
[2024-06-04 17:57:58,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:57:58,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:57:58,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:57:58,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:57:58,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:57:58,491 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:57:58,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 156 transitions, 1875 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:57:58,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:57:58,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:57:58,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:57:59,544 INFO  L124   PetriNetUnfolderBase]: 2141/3214 cut-off events.
[2024-06-04 17:57:59,544 INFO  L125   PetriNetUnfolderBase]: For 47160/47164 co-relation queries the response was YES.
[2024-06-04 17:57:59,555 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19773 conditions, 3214 events. 2141/3214 cut-off events. For 47160/47164 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15114 event pairs, 544 based on Foata normal form. 12/3220 useless extension candidates. Maximal degree in co-relation 19717. Up to 2680 conditions per place. 
[2024-06-04 17:57:59,565 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 107 selfloop transitions, 76 changer transitions 0/186 dead transitions.
[2024-06-04 17:57:59,565 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 186 transitions, 2528 flow
[2024-06-04 17:57:59,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:57:59,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:57:59,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-04 17:57:59,568 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-04 17:57:59,568 INFO  L175             Difference]: Start difference. First operand has 118 places, 156 transitions, 1875 flow. Second operand 8 states and 139 transitions.
[2024-06-04 17:57:59,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 186 transitions, 2528 flow
[2024-06-04 17:57:59,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 186 transitions, 2398 flow, removed 30 selfloop flow, removed 3 redundant places.
[2024-06-04 17:57:59,618 INFO  L231             Difference]: Finished difference. Result has 124 places, 158 transitions, 1938 flow
[2024-06-04 17:57:59,618 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1938, PETRI_PLACES=124, PETRI_TRANSITIONS=158}
[2024-06-04 17:57:59,618 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places.
[2024-06-04 17:57:59,619 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 158 transitions, 1938 flow
[2024-06-04 17:57:59,619 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:57:59,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:57:59,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:57:59,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 17:57:59,619 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-04 17:57:59,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:57:59,619 INFO  L85        PathProgramCache]: Analyzing trace with hash 643050680, now seen corresponding path program 1 times
[2024-06-04 17:57:59,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:57:59,619 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035912221]
[2024-06-04 17:57:59,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:57:59,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:57:59,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:06,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:58:06,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:06,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035912221]
[2024-06-04 17:58:06,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035912221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:06,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:06,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:58:06,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553825946]
[2024-06-04 17:58:06,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:06,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:58:06,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:06,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:58:06,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:58:06,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:06,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 158 transitions, 1938 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:58:06,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:06,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:06,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:07,418 INFO  L124   PetriNetUnfolderBase]: 2152/3230 cut-off events.
[2024-06-04 17:58:07,418 INFO  L125   PetriNetUnfolderBase]: For 50722/50741 co-relation queries the response was YES.
[2024-06-04 17:58:07,479 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20119 conditions, 3230 events. 2152/3230 cut-off events. For 50722/50741 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15213 event pairs, 553 based on Foata normal form. 10/3234 useless extension candidates. Maximal degree in co-relation 20061. Up to 2732 conditions per place. 
[2024-06-04 17:58:07,490 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 117 selfloop transitions, 65 changer transitions 0/185 dead transitions.
[2024-06-04 17:58:07,490 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 185 transitions, 2566 flow
[2024-06-04 17:58:07,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:58:07,491 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:58:07,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 17:58:07,492 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-04 17:58:07,492 INFO  L175             Difference]: Start difference. First operand has 124 places, 158 transitions, 1938 flow. Second operand 7 states and 124 transitions.
[2024-06-04 17:58:07,492 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 185 transitions, 2566 flow
[2024-06-04 17:58:07,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 2398 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-04 17:58:07,540 INFO  L231             Difference]: Finished difference. Result has 126 places, 161 transitions, 1950 flow
[2024-06-04 17:58:07,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1950, PETRI_PLACES=126, PETRI_TRANSITIONS=161}
[2024-06-04 17:58:07,541 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places.
[2024-06-04 17:58:07,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 1950 flow
[2024-06-04 17:58:07,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:58:07,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:07,541 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:07,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 17:58:07,541 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:58:07,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:07,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 642783770, now seen corresponding path program 2 times
[2024-06-04 17:58:07,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:07,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295343868]
[2024-06-04 17:58:07,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:07,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:07,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:13,893 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-04 17:58:13,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:13,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295343868]
[2024-06-04 17:58:13,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295343868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:13,894 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:13,894 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:58:13,894 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004954700]
[2024-06-04 17:58:13,894 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:13,894 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:58:13,895 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:13,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:58:13,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:58:14,059 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:14,060 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 1950 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:58:14,060 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:14,060 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:14,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:15,164 INFO  L124   PetriNetUnfolderBase]: 2131/3199 cut-off events.
[2024-06-04 17:58:15,164 INFO  L125   PetriNetUnfolderBase]: For 53915/53934 co-relation queries the response was YES.
[2024-06-04 17:58:15,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20007 conditions, 3199 events. 2131/3199 cut-off events. For 53915/53934 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15065 event pairs, 554 based on Foata normal form. 14/3207 useless extension candidates. Maximal degree in co-relation 19947. Up to 2786 conditions per place. 
[2024-06-04 17:58:15,188 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 122 selfloop transitions, 59 changer transitions 0/184 dead transitions.
[2024-06-04 17:58:15,188 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 184 transitions, 2466 flow
[2024-06-04 17:58:15,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:58:15,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:58:15,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 17:58:15,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-04 17:58:15,191 INFO  L175             Difference]: Start difference. First operand has 126 places, 161 transitions, 1950 flow. Second operand 7 states and 124 transitions.
[2024-06-04 17:58:15,191 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 184 transitions, 2466 flow
[2024-06-04 17:58:15,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 184 transitions, 2320 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-04 17:58:15,251 INFO  L231             Difference]: Finished difference. Result has 129 places, 161 transitions, 1932 flow
[2024-06-04 17:58:15,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1932, PETRI_PLACES=129, PETRI_TRANSITIONS=161}
[2024-06-04 17:58:15,252 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places.
[2024-06-04 17:58:15,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1932 flow
[2024-06-04 17:58:15,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 17:58:15,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:15,252 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:15,252 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 17:58:15,253 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-04 17:58:15,253 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:15,253 INFO  L85        PathProgramCache]: Analyzing trace with hash 261312864, now seen corresponding path program 1 times
[2024-06-04 17:58:15,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:15,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857491735]
[2024-06-04 17:58:15,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:15,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:15,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:21,734 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-04 17:58:21,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:21,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857491735]
[2024-06-04 17:58:21,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857491735] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:21,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:21,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:58:21,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132251639]
[2024-06-04 17:58:21,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:21,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:58:21,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:21,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:58:21,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:58:21,895 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:21,895 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1932 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:58:21,895 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:21,895 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:21,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:23,150 INFO  L124   PetriNetUnfolderBase]: 2178/3274 cut-off events.
[2024-06-04 17:58:23,150 INFO  L125   PetriNetUnfolderBase]: For 58016/58020 co-relation queries the response was YES.
[2024-06-04 17:58:23,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20579 conditions, 3274 events. 2178/3274 cut-off events. For 58016/58020 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15505 event pairs, 548 based on Foata normal form. 8/3280 useless extension candidates. Maximal degree in co-relation 20518. Up to 3123 conditions per place. 
[2024-06-04 17:58:23,171 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 167 selfloop transitions, 33 changer transitions 0/203 dead transitions.
[2024-06-04 17:58:23,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 203 transitions, 2546 flow
[2024-06-04 17:58:23,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:58:23,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:58:23,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-04 17:58:23,174 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4010840108401084
[2024-06-04 17:58:23,174 INFO  L175             Difference]: Start difference. First operand has 129 places, 161 transitions, 1932 flow. Second operand 9 states and 148 transitions.
[2024-06-04 17:58:23,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 203 transitions, 2546 flow
[2024-06-04 17:58:23,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 203 transitions, 2368 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-04 17:58:23,227 INFO  L231             Difference]: Finished difference. Result has 133 places, 170 transitions, 1961 flow
[2024-06-04 17:58:23,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1961, PETRI_PLACES=133, PETRI_TRANSITIONS=170}
[2024-06-04 17:58:23,227 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places.
[2024-06-04 17:58:23,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 170 transitions, 1961 flow
[2024-06-04 17:58:23,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:58:23,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:23,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:23,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 17:58:23,228 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-04 17:58:23,228 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:23,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -319470718, now seen corresponding path program 2 times
[2024-06-04 17:58:23,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:23,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884974035]
[2024-06-04 17:58:23,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:23,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:23,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:29,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:58:29,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:29,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884974035]
[2024-06-04 17:58:29,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884974035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:29,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:29,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:58:29,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669910111]
[2024-06-04 17:58:29,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:29,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:58:29,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:29,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:58:29,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:58:29,704 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:29,705 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 170 transitions, 1961 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:58:29,705 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:29,705 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:29,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:30,849 INFO  L124   PetriNetUnfolderBase]: 2195/3300 cut-off events.
[2024-06-04 17:58:30,849 INFO  L125   PetriNetUnfolderBase]: For 62913/62919 co-relation queries the response was YES.
[2024-06-04 17:58:30,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20980 conditions, 3300 events. 2195/3300 cut-off events. For 62913/62919 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15687 event pairs, 389 based on Foata normal form. 10/3308 useless extension candidates. Maximal degree in co-relation 20916. Up to 3097 conditions per place. 
[2024-06-04 17:58:30,874 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 164 selfloop transitions, 33 changer transitions 0/200 dead transitions.
[2024-06-04 17:58:30,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 200 transitions, 2493 flow
[2024-06-04 17:58:30,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:58:30,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:58:30,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-04 17:58:30,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-04 17:58:30,876 INFO  L175             Difference]: Start difference. First operand has 133 places, 170 transitions, 1961 flow. Second operand 8 states and 131 transitions.
[2024-06-04 17:58:30,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 200 transitions, 2493 flow
[2024-06-04 17:58:30,925 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 200 transitions, 2410 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 17:58:30,927 INFO  L231             Difference]: Finished difference. Result has 136 places, 172 transitions, 1994 flow
[2024-06-04 17:58:30,927 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1994, PETRI_PLACES=136, PETRI_TRANSITIONS=172}
[2024-06-04 17:58:30,928 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places.
[2024-06-04 17:58:30,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 172 transitions, 1994 flow
[2024-06-04 17:58:30,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:58:30,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:30,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:30,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 17:58:30,928 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-04 17:58:30,928 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:30,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -319410268, now seen corresponding path program 3 times
[2024-06-04 17:58:30,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:30,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490087919]
[2024-06-04 17:58:30,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:30,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:30,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:37,385 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-04 17:58:37,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:37,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490087919]
[2024-06-04 17:58:37,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490087919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:37,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:37,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:58:37,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437650881]
[2024-06-04 17:58:37,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:37,386 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:58:37,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:37,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:58:37,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:58:37,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:37,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 172 transitions, 1994 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:58:37,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:37,572 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:37,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:38,770 INFO  L124   PetriNetUnfolderBase]: 2212/3327 cut-off events.
[2024-06-04 17:58:38,770 INFO  L125   PetriNetUnfolderBase]: For 68261/68261 co-relation queries the response was YES.
[2024-06-04 17:58:38,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21511 conditions, 3327 events. 2212/3327 cut-off events. For 68261/68261 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15816 event pairs, 518 based on Foata normal form. 4/3329 useless extension candidates. Maximal degree in co-relation 21446. Up to 3136 conditions per place. 
[2024-06-04 17:58:38,793 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 160 selfloop transitions, 39 changer transitions 0/202 dead transitions.
[2024-06-04 17:58:38,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 202 transitions, 2536 flow
[2024-06-04 17:58:38,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:58:38,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:58:38,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 17:58:38,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-04 17:58:38,796 INFO  L175             Difference]: Start difference. First operand has 136 places, 172 transitions, 1994 flow. Second operand 8 states and 132 transitions.
[2024-06-04 17:58:38,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 202 transitions, 2536 flow
[2024-06-04 17:58:38,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 202 transitions, 2436 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-04 17:58:38,859 INFO  L231             Difference]: Finished difference. Result has 138 places, 174 transitions, 2026 flow
[2024-06-04 17:58:38,859 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2026, PETRI_PLACES=138, PETRI_TRANSITIONS=174}
[2024-06-04 17:58:38,860 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-04 17:58:38,860 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 174 transitions, 2026 flow
[2024-06-04 17:58:38,860 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:58:38,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:38,860 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:38,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 17:58:38,861 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-04 17:58:38,861 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:38,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 921671376, now seen corresponding path program 1 times
[2024-06-04 17:58:38,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:38,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686001254]
[2024-06-04 17:58:38,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:38,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:38,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:45,157 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-04 17:58:45,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:45,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686001254]
[2024-06-04 17:58:45,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686001254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:45,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:45,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:58:45,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775295095]
[2024-06-04 17:58:45,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:45,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:58:45,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:45,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:58:45,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:58:45,310 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:45,311 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 174 transitions, 2026 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:58:45,311 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:45,311 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:45,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:46,420 INFO  L124   PetriNetUnfolderBase]: 2192/3289 cut-off events.
[2024-06-04 17:58:46,421 INFO  L125   PetriNetUnfolderBase]: For 68277/68296 co-relation queries the response was YES.
[2024-06-04 17:58:46,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21217 conditions, 3289 events. 2192/3289 cut-off events. For 68277/68296 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15512 event pairs, 515 based on Foata normal form. 16/3301 useless extension candidates. Maximal degree in co-relation 21151. Up to 3082 conditions per place. 
[2024-06-04 17:58:46,442 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 151 selfloop transitions, 42 changer transitions 0/196 dead transitions.
[2024-06-04 17:58:46,442 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 196 transitions, 2496 flow
[2024-06-04 17:58:46,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:58:46,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:58:46,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 17:58:46,444 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-04 17:58:46,444 INFO  L175             Difference]: Start difference. First operand has 138 places, 174 transitions, 2026 flow. Second operand 7 states and 117 transitions.
[2024-06-04 17:58:46,444 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 196 transitions, 2496 flow
[2024-06-04 17:58:46,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 196 transitions, 2380 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-04 17:58:46,500 INFO  L231             Difference]: Finished difference. Result has 139 places, 174 transitions, 2008 flow
[2024-06-04 17:58:46,501 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2008, PETRI_PLACES=139, PETRI_TRANSITIONS=174}
[2024-06-04 17:58:46,501 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places.
[2024-06-04 17:58:46,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 174 transitions, 2008 flow
[2024-06-04 17:58:46,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:58:46,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:46,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:46,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 17:58:46,502 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-04 17:58:46,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:46,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -333737722, now seen corresponding path program 4 times
[2024-06-04 17:58:46,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:46,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816001460]
[2024-06-04 17:58:46,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:46,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:46,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:58:52,883 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-04 17:58:52,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:58:52,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816001460]
[2024-06-04 17:58:52,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816001460] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:58:52,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:58:52,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:58:52,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71742333]
[2024-06-04 17:58:52,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:58:52,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:58:52,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:58:52,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:58:52,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:58:53,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:58:53,016 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 174 transitions, 2008 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:58:53,016 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:58:53,016 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:58:53,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:58:54,204 INFO  L124   PetriNetUnfolderBase]: 2344/3513 cut-off events.
[2024-06-04 17:58:54,204 INFO  L125   PetriNetUnfolderBase]: For 76023/76023 co-relation queries the response was YES.
[2024-06-04 17:58:54,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23222 conditions, 3513 events. 2344/3513 cut-off events. For 76023/76023 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16703 event pairs, 510 based on Foata normal form. 4/3512 useless extension candidates. Maximal degree in co-relation 23155. Up to 3283 conditions per place. 
[2024-06-04 17:58:54,229 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 174 selfloop transitions, 65 changer transitions 0/242 dead transitions.
[2024-06-04 17:58:54,230 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 242 transitions, 3326 flow
[2024-06-04 17:58:54,231 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:58:54,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:58:54,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-04 17:58:54,232 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 17:58:54,232 INFO  L175             Difference]: Start difference. First operand has 139 places, 174 transitions, 2008 flow. Second operand 9 states and 144 transitions.
[2024-06-04 17:58:54,232 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 242 transitions, 3326 flow
[2024-06-04 17:58:54,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 242 transitions, 3094 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-04 17:58:54,298 INFO  L231             Difference]: Finished difference. Result has 144 places, 210 transitions, 2662 flow
[2024-06-04 17:58:54,298 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2662, PETRI_PLACES=144, PETRI_TRANSITIONS=210}
[2024-06-04 17:58:54,299 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places.
[2024-06-04 17:58:54,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 210 transitions, 2662 flow
[2024-06-04 17:58:54,299 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:58:54,299 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:58:54,299 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:58:54,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 17:58:54,299 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:58:54,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:58:54,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 610310366, now seen corresponding path program 1 times
[2024-06-04 17:58:54,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:58:54,300 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929869916]
[2024-06-04 17:58:54,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:58:54,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:58:54,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:04,138 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-04 17:59:04,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:04,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929869916]
[2024-06-04 17:59:04,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929869916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:04,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:04,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:59:04,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125044792]
[2024-06-04 17:59:04,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:04,139 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:59:04,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:04,139 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:59:04,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:59:04,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:04,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 210 transitions, 2662 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:59:04,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:04,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:04,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:05,383 INFO  L124   PetriNetUnfolderBase]: 2341/3511 cut-off events.
[2024-06-04 17:59:05,383 INFO  L125   PetriNetUnfolderBase]: For 76065/76069 co-relation queries the response was YES.
[2024-06-04 17:59:05,396 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23383 conditions, 3511 events. 2341/3511 cut-off events. For 76065/76069 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16804 event pairs, 543 based on Foata normal form. 5/3514 useless extension candidates. Maximal degree in co-relation 23312. Up to 3448 conditions per place. 
[2024-06-04 17:59:05,405 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 206 selfloop transitions, 22 changer transitions 0/231 dead transitions.
[2024-06-04 17:59:05,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 231 transitions, 3300 flow
[2024-06-04 17:59:05,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:59:05,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:59:05,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-04 17:59:05,407 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-04 17:59:05,407 INFO  L175             Difference]: Start difference. First operand has 144 places, 210 transitions, 2662 flow. Second operand 6 states and 98 transitions.
[2024-06-04 17:59:05,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 231 transitions, 3300 flow
[2024-06-04 17:59:05,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 231 transitions, 3123 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 17:59:05,474 INFO  L231             Difference]: Finished difference. Result has 147 places, 217 transitions, 2660 flow
[2024-06-04 17:59:05,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2660, PETRI_PLACES=147, PETRI_TRANSITIONS=217}
[2024-06-04 17:59:05,475 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places.
[2024-06-04 17:59:05,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 2660 flow
[2024-06-04 17:59:05,475 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:59:05,475 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:05,475 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:05,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 17:59:05,475 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-04 17:59:05,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:05,475 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776623708, now seen corresponding path program 5 times
[2024-06-04 17:59:05,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:05,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166472297]
[2024-06-04 17:59:05,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:05,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:05,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:12,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-04 17:59:12,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:12,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166472297]
[2024-06-04 17:59:12,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166472297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:12,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:12,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:59:12,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728265033]
[2024-06-04 17:59:12,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:12,726 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:59:12,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:12,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:59:12,726 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:59:12,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:12,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 2660 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:59:12,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:12,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:12,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:14,231 INFO  L124   PetriNetUnfolderBase]: 2450/3692 cut-off events.
[2024-06-04 17:59:14,231 INFO  L125   PetriNetUnfolderBase]: For 89841/89845 co-relation queries the response was YES.
[2024-06-04 17:59:14,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24586 conditions, 3692 events. 2450/3692 cut-off events. For 89841/89845 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17900 event pairs, 537 based on Foata normal form. 32/3719 useless extension candidates. Maximal degree in co-relation 24512. Up to 2860 conditions per place. 
[2024-06-04 17:59:14,258 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 146 selfloop transitions, 101 changer transitions 0/250 dead transitions.
[2024-06-04 17:59:14,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 250 transitions, 3328 flow
[2024-06-04 17:59:14,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:59:14,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:59:14,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 17:59:14,260 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 17:59:14,260 INFO  L175             Difference]: Start difference. First operand has 147 places, 217 transitions, 2660 flow. Second operand 8 states and 144 transitions.
[2024-06-04 17:59:14,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 250 transitions, 3328 flow
[2024-06-04 17:59:14,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 250 transitions, 3275 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-04 17:59:14,337 INFO  L231             Difference]: Finished difference. Result has 153 places, 220 transitions, 2877 flow
[2024-06-04 17:59:14,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2877, PETRI_PLACES=153, PETRI_TRANSITIONS=220}
[2024-06-04 17:59:14,338 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places.
[2024-06-04 17:59:14,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 220 transitions, 2877 flow
[2024-06-04 17:59:14,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:59:14,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:14,338 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:14,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 17:59:14,338 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-04 17:59:14,339 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:14,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548537860, now seen corresponding path program 1 times
[2024-06-04 17:59:14,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:14,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311726567]
[2024-06-04 17:59:14,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:14,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:14,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:20,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:59:20,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:20,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311726567]
[2024-06-04 17:59:20,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311726567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:20,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:20,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:59:20,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419864849]
[2024-06-04 17:59:20,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:20,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:59:20,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:20,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:59:20,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:59:21,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:21,110 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 220 transitions, 2877 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:21,110 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:21,110 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:21,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:22,362 INFO  L124   PetriNetUnfolderBase]: 2467/3717 cut-off events.
[2024-06-04 17:59:22,362 INFO  L125   PetriNetUnfolderBase]: For 91798/91806 co-relation queries the response was YES.
[2024-06-04 17:59:22,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25679 conditions, 3717 events. 2467/3717 cut-off events. For 91798/91806 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18130 event pairs, 561 based on Foata normal form. 12/3726 useless extension candidates. Maximal degree in co-relation 25603. Up to 3560 conditions per place. 
[2024-06-04 17:59:22,390 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 211 selfloop transitions, 33 changer transitions 0/247 dead transitions.
[2024-06-04 17:59:22,391 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 247 transitions, 3513 flow
[2024-06-04 17:59:22,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:59:22,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:59:22,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-04 17:59:22,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 17:59:22,393 INFO  L175             Difference]: Start difference. First operand has 153 places, 220 transitions, 2877 flow. Second operand 8 states and 128 transitions.
[2024-06-04 17:59:22,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 247 transitions, 3513 flow
[2024-06-04 17:59:22,474 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 247 transitions, 3277 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-04 17:59:22,477 INFO  L231             Difference]: Finished difference. Result has 156 places, 224 transitions, 2786 flow
[2024-06-04 17:59:22,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2786, PETRI_PLACES=156, PETRI_TRANSITIONS=224}
[2024-06-04 17:59:22,478 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places.
[2024-06-04 17:59:22,478 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 224 transitions, 2786 flow
[2024-06-04 17:59:22,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:22,479 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:22,479 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:22,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 17:59:22,479 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-04 17:59:22,479 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:22,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -1540263650, now seen corresponding path program 2 times
[2024-06-04 17:59:22,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:22,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525338586]
[2024-06-04 17:59:22,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:22,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:22,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:29,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-04 17:59:29,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:29,352 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525338586]
[2024-06-04 17:59:29,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525338586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:29,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:29,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:59:29,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223950810]
[2024-06-04 17:59:29,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:29,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:59:29,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:29,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:59:29,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:59:29,463 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:29,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 224 transitions, 2786 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:29,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:29,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:29,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:30,790 INFO  L124   PetriNetUnfolderBase]: 2484/3744 cut-off events.
[2024-06-04 17:59:30,791 INFO  L125   PetriNetUnfolderBase]: For 95609/95617 co-relation queries the response was YES.
[2024-06-04 17:59:30,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25674 conditions, 3744 events. 2484/3744 cut-off events. For 95609/95617 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18267 event pairs, 566 based on Foata normal form. 12/3753 useless extension candidates. Maximal degree in co-relation 25596. Up to 3542 conditions per place. 
[2024-06-04 17:59:30,820 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 208 selfloop transitions, 42 changer transitions 0/253 dead transitions.
[2024-06-04 17:59:30,820 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 253 transitions, 3438 flow
[2024-06-04 17:59:30,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:59:30,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:59:30,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions.
[2024-06-04 17:59:30,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875338753387534
[2024-06-04 17:59:30,822 INFO  L175             Difference]: Start difference. First operand has 156 places, 224 transitions, 2786 flow. Second operand 9 states and 143 transitions.
[2024-06-04 17:59:30,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 253 transitions, 3438 flow
[2024-06-04 17:59:30,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 253 transitions, 3339 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-04 17:59:30,902 INFO  L231             Difference]: Finished difference. Result has 160 places, 226 transitions, 2833 flow
[2024-06-04 17:59:30,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2833, PETRI_PLACES=160, PETRI_TRANSITIONS=226}
[2024-06-04 17:59:30,903 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places.
[2024-06-04 17:59:30,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 226 transitions, 2833 flow
[2024-06-04 17:59:30,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:30,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:30,904 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:30,904 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 17:59:30,904 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-04 17:59:30,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:30,905 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548298850, now seen corresponding path program 3 times
[2024-06-04 17:59:30,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:30,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975194210]
[2024-06-04 17:59:30,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:30,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:30,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:37,718 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-04 17:59:37,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:37,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975194210]
[2024-06-04 17:59:37,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975194210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:37,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:37,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:59:37,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094743251]
[2024-06-04 17:59:37,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:37,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:59:37,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:37,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:59:37,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:59:37,873 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:37,873 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 226 transitions, 2833 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:37,873 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:37,873 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:37,873 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:39,110 INFO  L124   PetriNetUnfolderBase]: 2476/3732 cut-off events.
[2024-06-04 17:59:39,111 INFO  L125   PetriNetUnfolderBase]: For 100236/100244 co-relation queries the response was YES.
[2024-06-04 17:59:39,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25802 conditions, 3732 events. 2476/3732 cut-off events. For 100236/100244 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18260 event pairs, 515 based on Foata normal form. 12/3741 useless extension candidates. Maximal degree in co-relation 25723. Up to 3471 conditions per place. 
[2024-06-04 17:59:39,144 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 43 changer transitions 0/253 dead transitions.
[2024-06-04 17:59:39,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 253 transitions, 3488 flow
[2024-06-04 17:59:39,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:59:39,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:59:39,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-04 17:59:39,146 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3932926829268293
[2024-06-04 17:59:39,146 INFO  L175             Difference]: Start difference. First operand has 160 places, 226 transitions, 2833 flow. Second operand 8 states and 129 transitions.
[2024-06-04 17:59:39,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 253 transitions, 3488 flow
[2024-06-04 17:59:39,231 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 253 transitions, 3358 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-04 17:59:39,234 INFO  L231             Difference]: Finished difference. Result has 162 places, 229 transitions, 2877 flow
[2024-06-04 17:59:39,234 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2877, PETRI_PLACES=162, PETRI_TRANSITIONS=229}
[2024-06-04 17:59:39,235 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-04 17:59:39,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 229 transitions, 2877 flow
[2024-06-04 17:59:39,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:39,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:39,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:39,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 17:59:39,235 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-04 17:59:39,236 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:39,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 209633856, now seen corresponding path program 2 times
[2024-06-04 17:59:39,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:39,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746706625]
[2024-06-04 17:59:39,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:39,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:39,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:48,695 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-04 17:59:48,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:48,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746706625]
[2024-06-04 17:59:48,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746706625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:48,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:48,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:59:48,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535306323]
[2024-06-04 17:59:48,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:48,697 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:59:48,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:48,697 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:59:48,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:59:48,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:48,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 229 transitions, 2877 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:59:48,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:48,818 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:48,818 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:49,985 INFO  L124   PetriNetUnfolderBase]: 2458/3707 cut-off events.
[2024-06-04 17:59:49,985 INFO  L125   PetriNetUnfolderBase]: For 98037/98041 co-relation queries the response was YES.
[2024-06-04 17:59:50,004 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25523 conditions, 3707 events. 2458/3707 cut-off events. For 98037/98041 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18134 event pairs, 555 based on Foata normal form. 8/3713 useless extension candidates. Maximal degree in co-relation 25442. Up to 3637 conditions per place. 
[2024-06-04 17:59:50,019 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 214 selfloop transitions, 27 changer transitions 0/244 dead transitions.
[2024-06-04 17:59:50,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 244 transitions, 3435 flow
[2024-06-04 17:59:50,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:59:50,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:59:50,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-04 17:59:50,020 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 17:59:50,020 INFO  L175             Difference]: Start difference. First operand has 162 places, 229 transitions, 2877 flow. Second operand 5 states and 90 transitions.
[2024-06-04 17:59:50,020 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 244 transitions, 3435 flow
[2024-06-04 17:59:50,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 244 transitions, 3290 flow, removed 36 selfloop flow, removed 5 redundant places.
[2024-06-04 17:59:50,178 INFO  L231             Difference]: Finished difference. Result has 162 places, 231 transitions, 2839 flow
[2024-06-04 17:59:50,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2732, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2839, PETRI_PLACES=162, PETRI_TRANSITIONS=231}
[2024-06-04 17:59:50,178 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-04 17:59:50,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 231 transitions, 2839 flow
[2024-06-04 17:59:50,179 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:59:50,179 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:50,179 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:50,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 17:59:50,179 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-04 17:59:50,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:50,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 367399234, now seen corresponding path program 6 times
[2024-06-04 17:59:50,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:50,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772805448]
[2024-06-04 17:59:50,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:50,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:50,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:59:57,048 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-04 17:59:57,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:59:57,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772805448]
[2024-06-04 17:59:57,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772805448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:59:57,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:59:57,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:59:57,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838520614]
[2024-06-04 17:59:57,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:59:57,049 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:59:57,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:59:57,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:59:57,050 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:59:57,200 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 17:59:57,201 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 231 transitions, 2839 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:57,201 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:59:57,201 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 17:59:57,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:59:58,469 INFO  L124   PetriNetUnfolderBase]: 2510/3783 cut-off events.
[2024-06-04 17:59:58,469 INFO  L125   PetriNetUnfolderBase]: For 101882/101882 co-relation queries the response was YES.
[2024-06-04 17:59:58,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25901 conditions, 3783 events. 2510/3783 cut-off events. For 101882/101882 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18529 event pairs, 536 based on Foata normal form. 4/3785 useless extension candidates. Maximal degree in co-relation 25819. Up to 3479 conditions per place. 
[2024-06-04 17:59:58,503 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 190 selfloop transitions, 90 changer transitions 0/283 dead transitions.
[2024-06-04 17:59:58,503 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 283 transitions, 3824 flow
[2024-06-04 17:59:58,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:59:58,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:59:58,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 17:59:58,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-04 17:59:58,506 INFO  L175             Difference]: Start difference. First operand has 162 places, 231 transitions, 2839 flow. Second operand 9 states and 149 transitions.
[2024-06-04 17:59:58,506 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 283 transitions, 3824 flow
[2024-06-04 17:59:58,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 283 transitions, 3779 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-06-04 17:59:58,634 INFO  L231             Difference]: Finished difference. Result has 171 places, 251 transitions, 3379 flow
[2024-06-04 17:59:58,634 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2794, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3379, PETRI_PLACES=171, PETRI_TRANSITIONS=251}
[2024-06-04 17:59:58,634 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places.
[2024-06-04 17:59:58,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 251 transitions, 3379 flow
[2024-06-04 17:59:58,635 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-04 17:59:58,635 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:59:58,635 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:59:58,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 17:59:58,635 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-04 17:59:58,635 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:59:58,635 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088220804, now seen corresponding path program 1 times
[2024-06-04 17:59:58,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:59:58,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168404159]
[2024-06-04 17:59:58,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:59:58,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:59:58,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:00:05,062 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-04 18:00:05,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:00:05,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168404159]
[2024-06-04 18:00:05,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168404159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:00:05,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:00:05,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:00:05,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493563011]
[2024-06-04 18:00:05,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:00:05,063 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:00:05,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:00:05,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:00:05,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:00:05,235 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:00:05,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 251 transitions, 3379 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:00:05,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:00:05,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:00:05,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:00:06,679 INFO  L124   PetriNetUnfolderBase]: 2527/3813 cut-off events.
[2024-06-04 18:00:06,679 INFO  L125   PetriNetUnfolderBase]: For 112142/112175 co-relation queries the response was YES.
[2024-06-04 18:00:06,703 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26920 conditions, 3813 events. 2527/3813 cut-off events. For 112142/112175 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18730 event pairs, 371 based on Foata normal form. 30/3839 useless extension candidates. Maximal degree in co-relation 26834. Up to 3516 conditions per place. 
[2024-06-04 18:00:06,719 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 223 selfloop transitions, 54 changer transitions 0/280 dead transitions.
[2024-06-04 18:00:06,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 280 transitions, 4073 flow
[2024-06-04 18:00:06,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:00:06,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:00:06,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-04 18:00:06,722 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3932926829268293
[2024-06-04 18:00:06,722 INFO  L175             Difference]: Start difference. First operand has 171 places, 251 transitions, 3379 flow. Second operand 8 states and 129 transitions.
[2024-06-04 18:00:06,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 280 transitions, 4073 flow
[2024-06-04 18:00:06,847 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 280 transitions, 3933 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-04 18:00:06,851 INFO  L231             Difference]: Finished difference. Result has 175 places, 253 transitions, 3401 flow
[2024-06-04 18:00:06,852 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3401, PETRI_PLACES=175, PETRI_TRANSITIONS=253}
[2024-06-04 18:00:06,852 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-04 18:00:06,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 253 transitions, 3401 flow
[2024-06-04 18:00:06,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:00:06,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:00:06,853 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:00:06,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:00:06,853 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-04 18:00:06,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:00:06,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -1121680166, now seen corresponding path program 2 times
[2024-06-04 18:00:06,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:00:06,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100490417]
[2024-06-04 18:00:06,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:00:06,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:00:06,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:00:14,629 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-04 18:00:14,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:00:14,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100490417]
[2024-06-04 18:00:14,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100490417] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:00:14,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:00:14,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:00:14,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712076724]
[2024-06-04 18:00:14,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:00:14,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:00:14,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:00:14,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:00:14,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:00:14,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:00:14,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 253 transitions, 3401 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:00:14,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:00:14,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:00:14,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:00:16,376 INFO  L124   PetriNetUnfolderBase]: 2544/3837 cut-off events.
[2024-06-04 18:00:16,376 INFO  L125   PetriNetUnfolderBase]: For 118458/118491 co-relation queries the response was YES.
[2024-06-04 18:00:16,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27239 conditions, 3837 events. 2544/3837 cut-off events. For 118458/118491 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18906 event pairs, 501 based on Foata normal form. 30/3863 useless extension candidates. Maximal degree in co-relation 27152. Up to 3473 conditions per place. 
[2024-06-04 18:00:16,420 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 197 selfloop transitions, 82 changer transitions 0/282 dead transitions.
[2024-06-04 18:00:16,421 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 282 transitions, 4107 flow
[2024-06-04 18:00:16,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:00:16,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:00:16,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-04 18:00:16,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-04 18:00:16,423 INFO  L175             Difference]: Start difference. First operand has 175 places, 253 transitions, 3401 flow. Second operand 8 states and 131 transitions.
[2024-06-04 18:00:16,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 282 transitions, 4107 flow
[2024-06-04 18:00:16,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 282 transitions, 3965 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-04 18:00:16,566 INFO  L231             Difference]: Finished difference. Result has 177 places, 255 transitions, 3481 flow
[2024-06-04 18:00:16,566 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3481, PETRI_PLACES=177, PETRI_TRANSITIONS=255}
[2024-06-04 18:00:16,567 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places.
[2024-06-04 18:00:16,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 255 transitions, 3481 flow
[2024-06-04 18:00:16,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:00:16,567 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:00:16,567 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:00:16,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:00:16,567 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-04 18:00:16,568 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:00:16,568 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108086002, now seen corresponding path program 3 times
[2024-06-04 18:00:16,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:00:16,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523867431]
[2024-06-04 18:00:16,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:00:16,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:00:16,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:00:24,139 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-04 18:00:24,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:00:24,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523867431]
[2024-06-04 18:00:24,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523867431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:00:24,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:00:24,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:00:24,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532973845]
[2024-06-04 18:00:24,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:00:24,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:00:24,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:00:24,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:00:24,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:00:24,278 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:00:24,279 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 255 transitions, 3481 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:00:24,279 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:00:24,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:00:24,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:00:25,687 INFO  L124   PetriNetUnfolderBase]: 2561/3864 cut-off events.
[2024-06-04 18:00:25,687 INFO  L125   PetriNetUnfolderBase]: For 127028/127061 co-relation queries the response was YES.
[2024-06-04 18:00:25,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27820 conditions, 3864 events. 2561/3864 cut-off events. For 127028/127061 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19081 event pairs, 501 based on Foata normal form. 30/3890 useless extension candidates. Maximal degree in co-relation 27732. Up to 3422 conditions per place. 
[2024-06-04 18:00:25,730 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 205 selfloop transitions, 76 changer transitions 0/284 dead transitions.
[2024-06-04 18:00:25,730 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 284 transitions, 4193 flow
[2024-06-04 18:00:25,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:00:25,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:00:25,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 18:00:25,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-04 18:00:25,733 INFO  L175             Difference]: Start difference. First operand has 177 places, 255 transitions, 3481 flow. Second operand 8 states and 132 transitions.
[2024-06-04 18:00:25,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 284 transitions, 4193 flow
[2024-06-04 18:00:25,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 284 transitions, 3991 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-04 18:00:25,871 INFO  L231             Difference]: Finished difference. Result has 179 places, 257 transitions, 3492 flow
[2024-06-04 18:00:25,871 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3279, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3492, PETRI_PLACES=179, PETRI_TRANSITIONS=257}
[2024-06-04 18:00:25,872 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places.
[2024-06-04 18:00:25,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 257 transitions, 3492 flow
[2024-06-04 18:00:25,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:00:25,872 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:00:25,872 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:00:25,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:00:25,873 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:00:25,873 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:00:25,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -272460318, now seen corresponding path program 1 times
[2024-06-04 18:00:25,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:00:25,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807364620]
[2024-06-04 18:00:25,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:00:25,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:00:25,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:00:36,544 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-04 18:00:36,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:00:36,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807364620]
[2024-06-04 18:00:36,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807364620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:00:36,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:00:36,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:00:36,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766499533]
[2024-06-04 18:00:36,545 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:00:36,545 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:00:36,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:00:36,546 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:00:36,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:00:36,702 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:00:36,702 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 257 transitions, 3492 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:00:36,702 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:00:36,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:00:36,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:00:38,131 INFO  L124   PetriNetUnfolderBase]: 2571/3882 cut-off events.
[2024-06-04 18:00:38,132 INFO  L125   PetriNetUnfolderBase]: For 132409/132417 co-relation queries the response was YES.
[2024-06-04 18:00:38,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28126 conditions, 3882 events. 2571/3882 cut-off events. For 132409/132417 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19262 event pairs, 508 based on Foata normal form. 10/3890 useless extension candidates. Maximal degree in co-relation 28037. Up to 3677 conditions per place. 
[2024-06-04 18:00:38,179 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 224 selfloop transitions, 62 changer transitions 0/289 dead transitions.
[2024-06-04 18:00:38,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 289 transitions, 4326 flow
[2024-06-04 18:00:38,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:00:38,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:00:38,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-04 18:00:38,182 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41114982578397213
[2024-06-04 18:00:38,182 INFO  L175             Difference]: Start difference. First operand has 179 places, 257 transitions, 3492 flow. Second operand 7 states and 118 transitions.
[2024-06-04 18:00:38,182 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 289 transitions, 4326 flow
[2024-06-04 18:00:38,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 289 transitions, 4131 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-04 18:00:38,380 INFO  L231             Difference]: Finished difference. Result has 181 places, 266 transitions, 3604 flow
[2024-06-04 18:00:38,380 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3604, PETRI_PLACES=181, PETRI_TRANSITIONS=266}
[2024-06-04 18:00:38,381 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places.
[2024-06-04 18:00:38,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 266 transitions, 3604 flow
[2024-06-04 18:00:38,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:00:38,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:00:38,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:00:38,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:00:38,382 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:00:38,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:00:38,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -1234507668, now seen corresponding path program 1 times
[2024-06-04 18:00:38,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:00:38,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939083426]
[2024-06-04 18:00:38,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:00:38,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:00:38,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:00:46,050 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-04 18:00:46,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:00:46,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939083426]
[2024-06-04 18:00:46,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939083426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:00:46,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:00:46,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:00:46,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343774376]
[2024-06-04 18:00:46,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:00:46,052 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:00:46,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:00:46,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:00:46,053 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:00:46,278 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:00:46,279 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 266 transitions, 3604 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:00:46,279 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:00:46,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:00:46,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:00:47,940 INFO  L124   PetriNetUnfolderBase]: 2765/4200 cut-off events.
[2024-06-04 18:00:47,941 INFO  L125   PetriNetUnfolderBase]: For 165561/165592 co-relation queries the response was YES.
[2024-06-04 18:00:47,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31271 conditions, 4200 events. 2765/4200 cut-off events. For 165561/165592 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21333 event pairs, 461 based on Foata normal form. 28/4222 useless extension candidates. Maximal degree in co-relation 31180. Up to 2987 conditions per place. 
[2024-06-04 18:00:47,980 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 171 selfloop transitions, 130 changer transitions 0/304 dead transitions.
[2024-06-04 18:00:47,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 304 transitions, 4568 flow
[2024-06-04 18:00:47,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:00:47,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:00:47,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-04 18:00:47,983 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-04 18:00:47,983 INFO  L175             Difference]: Start difference. First operand has 181 places, 266 transitions, 3604 flow. Second operand 8 states and 146 transitions.
[2024-06-04 18:00:47,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 304 transitions, 4568 flow
[2024-06-04 18:00:48,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 304 transitions, 4507 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-04 18:00:48,142 INFO  L231             Difference]: Finished difference. Result has 186 places, 268 transitions, 3887 flow
[2024-06-04 18:00:48,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3887, PETRI_PLACES=186, PETRI_TRANSITIONS=268}
[2024-06-04 18:00:48,143 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-04 18:00:48,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 268 transitions, 3887 flow
[2024-06-04 18:00:48,144 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:00:48,144 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:00:48,144 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:00:48,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:00:48,144 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:00:48,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:00:48,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 1475233200, now seen corresponding path program 2 times
[2024-06-04 18:00:48,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:00:48,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443032415]
[2024-06-04 18:00:48,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:00:48,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:00:48,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:00:55,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:00:55,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:00:55,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443032415]
[2024-06-04 18:00:55,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443032415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:00:55,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:00:55,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:00:55,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712543760]
[2024-06-04 18:00:55,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:00:55,849 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:00:55,849 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:00:55,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:00:55,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:00:56,001 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:00:56,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 268 transitions, 3887 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:00:56,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:00:56,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:00:56,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:00:57,531 INFO  L124   PetriNetUnfolderBase]: 2807/4274 cut-off events.
[2024-06-04 18:00:57,531 INFO  L125   PetriNetUnfolderBase]: For 179356/179387 co-relation queries the response was YES.
[2024-06-04 18:00:57,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32335 conditions, 4274 events. 2807/4274 cut-off events. For 179356/179387 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21900 event pairs, 566 based on Foata normal form. 36/4304 useless extension candidates. Maximal degree in co-relation 32242. Up to 3413 conditions per place. 
[2024-06-04 18:00:57,569 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 169 selfloop transitions, 128 changer transitions 0/300 dead transitions.
[2024-06-04 18:00:57,570 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 300 transitions, 4661 flow
[2024-06-04 18:00:57,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:00:57,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:00:57,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:00:57,573 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-04 18:00:57,573 INFO  L175             Difference]: Start difference. First operand has 186 places, 268 transitions, 3887 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:00:57,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 300 transitions, 4661 flow
[2024-06-04 18:00:57,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 300 transitions, 4470 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-04 18:00:57,775 INFO  L231             Difference]: Finished difference. Result has 190 places, 270 transitions, 4021 flow
[2024-06-04 18:00:57,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3696, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4021, PETRI_PLACES=190, PETRI_TRANSITIONS=270}
[2024-06-04 18:00:57,776 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places.
[2024-06-04 18:00:57,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 270 transitions, 4021 flow
[2024-06-04 18:00:57,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:00:57,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:00:57,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:00:57,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:00:57,777 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:00:57,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:00:57,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1469518908, now seen corresponding path program 4 times
[2024-06-04 18:00:57,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:00:57,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556906613]
[2024-06-04 18:00:57,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:00:57,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:00:57,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:01:05,200 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-04 18:01:05,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:01:05,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556906613]
[2024-06-04 18:01:05,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556906613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:01:05,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:01:05,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:01:05,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609090849]
[2024-06-04 18:01:05,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:01:05,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:01:05,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:01:05,204 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:01:05,204 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:01:05,431 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:01:05,432 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 270 transitions, 4021 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:01:05,432 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:01:05,432 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:01:05,432 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:01:06,992 INFO  L124   PetriNetUnfolderBase]: 2799/4262 cut-off events.
[2024-06-04 18:01:06,992 INFO  L125   PetriNetUnfolderBase]: For 172965/172996 co-relation queries the response was YES.
[2024-06-04 18:01:07,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32653 conditions, 4262 events. 2799/4262 cut-off events. For 172965/172996 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21855 event pairs, 564 based on Foata normal form. 16/4272 useless extension candidates. Maximal degree in co-relation 32558. Up to 3521 conditions per place. 
[2024-06-04 18:01:07,030 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 176 selfloop transitions, 119 changer transitions 0/298 dead transitions.
[2024-06-04 18:01:07,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 298 transitions, 4771 flow
[2024-06-04 18:01:07,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:01:07,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:01:07,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-04 18:01:07,033 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:01:07,033 INFO  L175             Difference]: Start difference. First operand has 190 places, 270 transitions, 4021 flow. Second operand 8 states and 136 transitions.
[2024-06-04 18:01:07,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 298 transitions, 4771 flow
[2024-06-04 18:01:07,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 298 transitions, 4478 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-04 18:01:07,256 INFO  L231             Difference]: Finished difference. Result has 192 places, 272 transitions, 4037 flow
[2024-06-04 18:01:07,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4037, PETRI_PLACES=192, PETRI_TRANSITIONS=272}
[2024-06-04 18:01:07,257 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places.
[2024-06-04 18:01:07,257 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 272 transitions, 4037 flow
[2024-06-04 18:01:07,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:01:07,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:01:07,258 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:01:07,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:01:07,258 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:01:07,259 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:01:07,259 INFO  L85        PathProgramCache]: Analyzing trace with hash 662514652, now seen corresponding path program 5 times
[2024-06-04 18:01:07,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:01:07,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885160740]
[2024-06-04 18:01:07,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:01:07,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:01:07,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:01:14,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:01:14,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:01:14,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885160740]
[2024-06-04 18:01:14,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885160740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:01:14,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:01:14,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:01:14,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527740666]
[2024-06-04 18:01:14,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:01:14,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:01:14,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:01:14,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:01:14,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:01:14,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:01:14,471 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 272 transitions, 4037 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:01:14,471 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:01:14,471 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:01:14,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:01:16,073 INFO  L124   PetriNetUnfolderBase]: 2791/4250 cut-off events.
[2024-06-04 18:01:16,073 INFO  L125   PetriNetUnfolderBase]: For 174605/174636 co-relation queries the response was YES.
[2024-06-04 18:01:16,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32321 conditions, 4250 events. 2791/4250 cut-off events. For 174605/174636 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21733 event pairs, 562 based on Foata normal form. 16/4260 useless extension candidates. Maximal degree in co-relation 32225. Up to 3120 conditions per place. 
[2024-06-04 18:01:16,111 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 173 selfloop transitions, 128 changer transitions 0/304 dead transitions.
[2024-06-04 18:01:16,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 304 transitions, 4821 flow
[2024-06-04 18:01:16,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:01:16,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:01:16,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-04 18:01:16,112 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-04 18:01:16,112 INFO  L175             Difference]: Start difference. First operand has 192 places, 272 transitions, 4037 flow. Second operand 8 states and 140 transitions.
[2024-06-04 18:01:16,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 304 transitions, 4821 flow
[2024-06-04 18:01:16,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 304 transitions, 4532 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 18:01:16,301 INFO  L231             Difference]: Finished difference. Result has 194 places, 274 transitions, 4078 flow
[2024-06-04 18:01:16,301 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3748, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4078, PETRI_PLACES=194, PETRI_TRANSITIONS=274}
[2024-06-04 18:01:16,302 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-04 18:01:16,302 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 274 transitions, 4078 flow
[2024-06-04 18:01:16,302 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:01:16,302 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:01:16,302 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:01:16,303 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:01:16,303 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:01:16,303 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:01:16,303 INFO  L85        PathProgramCache]: Analyzing trace with hash -272161416, now seen corresponding path program 1 times
[2024-06-04 18:01:16,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:01:16,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366193486]
[2024-06-04 18:01:16,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:01:16,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:01:16,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:01:27,470 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-04 18:01:27,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:01:27,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366193486]
[2024-06-04 18:01:27,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366193486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:01:27,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:01:27,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:01:27,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824946586]
[2024-06-04 18:01:27,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:01:27,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:01:27,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:01:27,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:01:27,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:01:27,549 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:01:27,550 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 274 transitions, 4078 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:27,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:01:27,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:01:27,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:01:29,139 INFO  L124   PetriNetUnfolderBase]: 2801/4259 cut-off events.
[2024-06-04 18:01:29,139 INFO  L125   PetriNetUnfolderBase]: For 180033/180041 co-relation queries the response was YES.
[2024-06-04 18:01:29,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32722 conditions, 4259 events. 2801/4259 cut-off events. For 180033/180041 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21837 event pairs, 594 based on Foata normal form. 10/4267 useless extension candidates. Maximal degree in co-relation 32625. Up to 4167 conditions per place. 
[2024-06-04 18:01:29,189 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 260 selfloop transitions, 35 changer transitions 0/298 dead transitions.
[2024-06-04 18:01:29,189 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 298 transitions, 4910 flow
[2024-06-04 18:01:29,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:01:29,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:01:29,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-04 18:01:29,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-04 18:01:29,191 INFO  L175             Difference]: Start difference. First operand has 194 places, 274 transitions, 4078 flow. Second operand 7 states and 114 transitions.
[2024-06-04 18:01:29,191 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 298 transitions, 4910 flow
[2024-06-04 18:01:29,444 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 298 transitions, 4602 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-04 18:01:29,449 INFO  L231             Difference]: Finished difference. Result has 195 places, 280 transitions, 3952 flow
[2024-06-04 18:01:29,449 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3770, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3952, PETRI_PLACES=195, PETRI_TRANSITIONS=280}
[2024-06-04 18:01:29,449 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places.
[2024-06-04 18:01:29,449 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 280 transitions, 3952 flow
[2024-06-04 18:01:29,450 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:29,450 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:01:29,450 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:01:29,450 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:01:29,450 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:01:29,450 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:01:29,451 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101461564, now seen corresponding path program 2 times
[2024-06-04 18:01:29,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:01:29,451 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119301342]
[2024-06-04 18:01:29,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:01:29,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:01:29,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:01:40,734 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-04 18:01:40,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:01:40,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119301342]
[2024-06-04 18:01:40,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119301342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:01:40,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:01:40,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:01:40,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111535793]
[2024-06-04 18:01:40,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:01:40,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:01:40,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:01:40,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:01:40,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:01:40,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:01:40,851 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 280 transitions, 3952 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:40,851 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:01:40,851 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:01:40,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:01:42,423 INFO  L124   PetriNetUnfolderBase]: 2795/4252 cut-off events.
[2024-06-04 18:01:42,423 INFO  L125   PetriNetUnfolderBase]: For 184356/184356 co-relation queries the response was YES.
[2024-06-04 18:01:42,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32392 conditions, 4252 events. 2795/4252 cut-off events. For 184356/184356 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21771 event pairs, 575 based on Foata normal form. 2/4252 useless extension candidates. Maximal degree in co-relation 32294. Up to 4054 conditions per place. 
[2024-06-04 18:01:42,463 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 233 selfloop transitions, 62 changer transitions 0/298 dead transitions.
[2024-06-04 18:01:42,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 298 transitions, 4686 flow
[2024-06-04 18:01:42,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:01:42,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:01:42,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-04 18:01:42,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-04 18:01:42,466 INFO  L175             Difference]: Start difference. First operand has 195 places, 280 transitions, 3952 flow. Second operand 7 states and 114 transitions.
[2024-06-04 18:01:42,466 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 298 transitions, 4686 flow
[2024-06-04 18:01:42,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 298 transitions, 4625 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-04 18:01:42,643 INFO  L231             Difference]: Finished difference. Result has 199 places, 280 transitions, 4021 flow
[2024-06-04 18:01:42,643 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4021, PETRI_PLACES=199, PETRI_TRANSITIONS=280}
[2024-06-04 18:01:42,643 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places.
[2024-06-04 18:01:42,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 280 transitions, 4021 flow
[2024-06-04 18:01:42,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:42,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:01:42,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:01:42,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:01:42,644 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-04 18:01:42,644 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:01:42,644 INFO  L85        PathProgramCache]: Analyzing trace with hash -494334622, now seen corresponding path program 3 times
[2024-06-04 18:01:42,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:01:42,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749818829]
[2024-06-04 18:01:42,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:01:42,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:01:42,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:01:50,635 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-04 18:01:50,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:01:50,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749818829]
[2024-06-04 18:01:50,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749818829] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:01:50,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:01:50,635 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:01:50,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888918575]
[2024-06-04 18:01:50,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:01:50,635 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:01:50,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:01:50,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:01:50,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:01:50,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:01:50,821 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 280 transitions, 4021 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:50,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:01:50,821 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:01:50,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:01:52,415 INFO  L124   PetriNetUnfolderBase]: 2914/4457 cut-off events.
[2024-06-04 18:01:52,415 INFO  L125   PetriNetUnfolderBase]: For 217327/217358 co-relation queries the response was YES.
[2024-06-04 18:01:52,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34384 conditions, 4457 events. 2914/4457 cut-off events. For 217327/217358 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23188 event pairs, 534 based on Foata normal form. 28/4479 useless extension candidates. Maximal degree in co-relation 34284. Up to 2496 conditions per place. 
[2024-06-04 18:01:52,460 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 191 selfloop transitions, 123 changer transitions 0/317 dead transitions.
[2024-06-04 18:01:52,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 317 transitions, 5021 flow
[2024-06-04 18:01:52,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:01:52,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:01:52,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-04 18:01:52,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-04 18:01:52,463 INFO  L175             Difference]: Start difference. First operand has 199 places, 280 transitions, 4021 flow. Second operand 8 states and 143 transitions.
[2024-06-04 18:01:52,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 317 transitions, 5021 flow
[2024-06-04 18:01:52,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 317 transitions, 4923 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-04 18:01:52,697 INFO  L231             Difference]: Finished difference. Result has 203 places, 282 transitions, 4261 flow
[2024-06-04 18:01:52,698 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3923, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4261, PETRI_PLACES=203, PETRI_TRANSITIONS=282}
[2024-06-04 18:01:52,698 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places.
[2024-06-04 18:01:52,698 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 282 transitions, 4261 flow
[2024-06-04 18:01:52,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:52,699 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:01:52,699 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:01:52,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:01:52,699 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-04 18:01:52,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:01:52,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -503531392, now seen corresponding path program 4 times
[2024-06-04 18:01:52,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:01:52,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947652658]
[2024-06-04 18:01:52,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:01:52,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:01:52,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:01:59,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:01:59,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:01:59,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947652658]
[2024-06-04 18:01:59,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947652658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:01:59,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:01:59,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:01:59,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986010651]
[2024-06-04 18:01:59,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:01:59,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:01:59,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:01:59,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:01:59,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:01:59,784 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:01:59,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 282 transitions, 4261 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:01:59,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:01:59,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:01:59,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:01,538 INFO  L124   PetriNetUnfolderBase]: 3033/4658 cut-off events.
[2024-06-04 18:02:01,538 INFO  L125   PetriNetUnfolderBase]: For 244032/244063 co-relation queries the response was YES.
[2024-06-04 18:02:01,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36769 conditions, 4658 events. 3033/4658 cut-off events. For 244032/244063 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24730 event pairs, 634 based on Foata normal form. 28/4680 useless extension candidates. Maximal degree in co-relation 36668. Up to 3465 conditions per place. 
[2024-06-04 18:02:01,591 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 201 selfloop transitions, 115 changer transitions 0/319 dead transitions.
[2024-06-04 18:02:01,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 319 transitions, 5275 flow
[2024-06-04 18:02:01,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:02:01,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:02:01,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-04 18:02:01,594 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-04 18:02:01,594 INFO  L175             Difference]: Start difference. First operand has 203 places, 282 transitions, 4261 flow. Second operand 8 states and 146 transitions.
[2024-06-04 18:02:01,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 319 transitions, 5275 flow
[2024-06-04 18:02:01,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 319 transitions, 5111 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-04 18:02:01,948 INFO  L231             Difference]: Finished difference. Result has 207 places, 284 transitions, 4424 flow
[2024-06-04 18:02:01,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4101, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4424, PETRI_PLACES=207, PETRI_TRANSITIONS=284}
[2024-06-04 18:02:01,949 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places.
[2024-06-04 18:02:01,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 284 transitions, 4424 flow
[2024-06-04 18:02:01,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:01,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:01,950 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:01,950 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:02:01,950 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-04 18:02:01,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:01,950 INFO  L85        PathProgramCache]: Analyzing trace with hash -760241152, now seen corresponding path program 5 times
[2024-06-04 18:02:01,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:01,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623829780]
[2024-06-04 18:02:01,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:01,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:01,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:09,592 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-04 18:02:09,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:09,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623829780]
[2024-06-04 18:02:09,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623829780] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:09,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:09,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:02:09,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908495917]
[2024-06-04 18:02:09,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:09,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:02:09,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:09,595 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:02:09,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:02:09,831 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:02:09,831 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 284 transitions, 4424 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:02:09,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:09,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:02:09,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:11,692 INFO  L124   PetriNetUnfolderBase]: 3058/4705 cut-off events.
[2024-06-04 18:02:11,692 INFO  L125   PetriNetUnfolderBase]: For 249957/249988 co-relation queries the response was YES.
[2024-06-04 18:02:11,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37133 conditions, 4705 events. 3058/4705 cut-off events. For 249957/249988 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25077 event pairs, 650 based on Foata normal form. 32/4731 useless extension candidates. Maximal degree in co-relation 37030. Up to 3706 conditions per place. 
[2024-06-04 18:02:11,747 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 201 selfloop transitions, 115 changer transitions 0/319 dead transitions.
[2024-06-04 18:02:11,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 319 transitions, 5240 flow
[2024-06-04 18:02:11,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:02:11,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:02:11,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-04 18:02:11,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-04 18:02:11,751 INFO  L175             Difference]: Start difference. First operand has 207 places, 284 transitions, 4424 flow. Second operand 9 states and 157 transitions.
[2024-06-04 18:02:11,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 319 transitions, 5240 flow
[2024-06-04 18:02:12,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 319 transitions, 5075 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-04 18:02:12,266 INFO  L231             Difference]: Finished difference. Result has 212 places, 285 transitions, 4548 flow
[2024-06-04 18:02:12,267 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4548, PETRI_PLACES=212, PETRI_TRANSITIONS=285}
[2024-06-04 18:02:12,267 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-04 18:02:12,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 4548 flow
[2024-06-04 18:02:12,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-04 18:02:12,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:12,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-04 18:02:12,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:02:12,267 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:12,268 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:12,268 INFO  L85        PathProgramCache]: Analyzing trace with hash 824667898, now seen corresponding path program 3 times
[2024-06-04 18:02:12,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:12,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200362786]
[2024-06-04 18:02:12,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:12,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:12,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:23,547 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-04 18:02:23,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:23,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200362786]
[2024-06-04 18:02:23,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200362786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:23,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:23,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:02:23,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927851490]
[2024-06-04 18:02:23,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:23,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:02:23,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:23,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:02:23,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:02:23,727 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:02:23,728 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 4548 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:23,728 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:23,728 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:02:23,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:25,424 INFO  L124   PetriNetUnfolderBase]: 3025/4659 cut-off events.
[2024-06-04 18:02:25,424 INFO  L125   PetriNetUnfolderBase]: For 239309/239317 co-relation queries the response was YES.
[2024-06-04 18:02:25,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37043 conditions, 4659 events. 3025/4659 cut-off events. For 239309/239317 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24903 event pairs, 666 based on Foata normal form. 15/4672 useless extension candidates. Maximal degree in co-relation 36938. Up to 4465 conditions per place. 
[2024-06-04 18:02:25,475 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 234 selfloop transitions, 69 changer transitions 0/306 dead transitions.
[2024-06-04 18:02:25,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 306 transitions, 5236 flow
[2024-06-04 18:02:25,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:02:25,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:02:25,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-04 18:02:25,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-04 18:02:25,476 INFO  L175             Difference]: Start difference. First operand has 212 places, 285 transitions, 4548 flow. Second operand 6 states and 111 transitions.
[2024-06-04 18:02:25,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 306 transitions, 5236 flow
[2024-06-04 18:02:25,843 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 306 transitions, 4941 flow, removed 33 selfloop flow, removed 8 redundant places.
[2024-06-04 18:02:25,847 INFO  L231             Difference]: Finished difference. Result has 210 places, 285 transitions, 4440 flow
[2024-06-04 18:02:25,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4253, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4440, PETRI_PLACES=210, PETRI_TRANSITIONS=285}
[2024-06-04 18:02:25,847 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places.
[2024-06-04 18:02:25,848 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 285 transitions, 4440 flow
[2024-06-04 18:02:25,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:25,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:25,849 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:25,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:02:25,849 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-04 18:02:25,849 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:25,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 2071421620, now seen corresponding path program 2 times
[2024-06-04 18:02:25,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:25,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131989129]
[2024-06-04 18:02:25,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:25,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:25,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:37,307 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-04 18:02:37,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:37,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131989129]
[2024-06-04 18:02:37,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131989129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:37,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:37,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:02:37,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777038478]
[2024-06-04 18:02:37,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:37,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:02:37,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:37,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:02:37,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:02:37,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:02:37,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 285 transitions, 4440 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:37,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:37,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:02:37,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:39,082 INFO  L124   PetriNetUnfolderBase]: 3019/4646 cut-off events.
[2024-06-04 18:02:39,082 INFO  L125   PetriNetUnfolderBase]: For 236833/236841 co-relation queries the response was YES.
[2024-06-04 18:02:39,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36612 conditions, 4646 events. 3019/4646 cut-off events. For 236833/236841 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 24818 event pairs, 688 based on Foata normal form. 10/4654 useless extension candidates. Maximal degree in co-relation 36507. Up to 4570 conditions per place. 
[2024-06-04 18:02:39,127 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 267 selfloop transitions, 30 changer transitions 0/300 dead transitions.
[2024-06-04 18:02:39,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 300 transitions, 5092 flow
[2024-06-04 18:02:39,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:02:39,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:02:39,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-04 18:02:39,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:02:39,128 INFO  L175             Difference]: Start difference. First operand has 210 places, 285 transitions, 4440 flow. Second operand 6 states and 102 transitions.
[2024-06-04 18:02:39,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 300 transitions, 5092 flow
[2024-06-04 18:02:39,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 300 transitions, 4971 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-04 18:02:39,422 INFO  L231             Difference]: Finished difference. Result has 212 places, 285 transitions, 4385 flow
[2024-06-04 18:02:39,422 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4319, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4385, PETRI_PLACES=212, PETRI_TRANSITIONS=285}
[2024-06-04 18:02:39,422 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-04 18:02:39,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 4385 flow
[2024-06-04 18:02:39,423 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:39,423 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:39,423 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:39,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:02:39,423 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:39,423 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:39,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -846974204, now seen corresponding path program 1 times
[2024-06-04 18:02:39,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:39,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389867879]
[2024-06-04 18:02:39,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:39,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:39,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:48,086 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-04 18:02:48,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:48,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389867879]
[2024-06-04 18:02:48,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389867879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:48,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:48,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:02:48,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479144353]
[2024-06-04 18:02:48,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:48,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:02:48,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:48,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:02:48,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:02:48,233 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:02:48,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 4385 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:48,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:48,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:02:48,234 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:49,773 INFO  L124   PetriNetUnfolderBase]: 3037/4671 cut-off events.
[2024-06-04 18:02:49,773 INFO  L125   PetriNetUnfolderBase]: For 246858/246870 co-relation queries the response was YES.
[2024-06-04 18:02:49,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36916 conditions, 4671 events. 3037/4671 cut-off events. For 246858/246870 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24953 event pairs, 690 based on Foata normal form. 14/4682 useless extension candidates. Maximal degree in co-relation 36810. Up to 4480 conditions per place. 
[2024-06-04 18:02:49,820 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 269 selfloop transitions, 46 changer transitions 0/318 dead transitions.
[2024-06-04 18:02:49,821 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 318 transitions, 5499 flow
[2024-06-04 18:02:49,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:02:49,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:02:49,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-04 18:02:49,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-04 18:02:49,822 INFO  L175             Difference]: Start difference. First operand has 212 places, 285 transitions, 4385 flow. Second operand 7 states and 116 transitions.
[2024-06-04 18:02:49,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 318 transitions, 5499 flow
[2024-06-04 18:02:50,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 318 transitions, 5402 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-04 18:02:50,125 INFO  L231             Difference]: Finished difference. Result has 215 places, 300 transitions, 4673 flow
[2024-06-04 18:02:50,125 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4288, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4673, PETRI_PLACES=215, PETRI_TRANSITIONS=300}
[2024-06-04 18:02:50,125 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places.
[2024-06-04 18:02:50,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 300 transitions, 4673 flow
[2024-06-04 18:02:50,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:50,125 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:50,126 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:50,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:02:50,126 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:50,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:50,126 INFO  L85        PathProgramCache]: Analyzing trace with hash -846854234, now seen corresponding path program 2 times
[2024-06-04 18:02:50,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:50,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558019348]
[2024-06-04 18:02:50,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:50,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:50,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:57,478 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-04 18:02:57,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:57,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558019348]
[2024-06-04 18:02:57,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558019348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:57,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:57,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:02:57,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176563908]
[2024-06-04 18:02:57,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:57,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:02:57,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:57,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:02:57,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:02:57,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:02:57,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 300 transitions, 4673 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:57,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:57,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:02:57,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:59,315 INFO  L124   PetriNetUnfolderBase]: 3141/4821 cut-off events.
[2024-06-04 18:02:59,315 INFO  L125   PetriNetUnfolderBase]: For 270152/270152 co-relation queries the response was YES.
[2024-06-04 18:02:59,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39172 conditions, 4821 events. 3141/4821 cut-off events. For 270152/270152 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25795 event pairs, 740 based on Foata normal form. 6/4825 useless extension candidates. Maximal degree in co-relation 39064. Up to 4698 conditions per place. 
[2024-06-04 18:02:59,361 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 306 selfloop transitions, 37 changer transitions 0/346 dead transitions.
[2024-06-04 18:02:59,361 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 346 transitions, 5964 flow
[2024-06-04 18:02:59,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:02:59,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:02:59,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-04 18:02:59,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 18:02:59,362 INFO  L175             Difference]: Start difference. First operand has 215 places, 300 transitions, 4673 flow. Second operand 8 states and 128 transitions.
[2024-06-04 18:02:59,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 346 transitions, 5964 flow
[2024-06-04 18:02:59,691 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 346 transitions, 5809 flow, removed 69 selfloop flow, removed 2 redundant places.
[2024-06-04 18:02:59,696 INFO  L231             Difference]: Finished difference. Result has 223 places, 326 transitions, 5091 flow
[2024-06-04 18:02:59,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5091, PETRI_PLACES=223, PETRI_TRANSITIONS=326}
[2024-06-04 18:02:59,697 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places.
[2024-06-04 18:02:59,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 326 transitions, 5091 flow
[2024-06-04 18:02:59,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:59,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:59,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:59,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:02:59,698 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:59,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:59,698 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043900316, now seen corresponding path program 3 times
[2024-06-04 18:02:59,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:59,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308634278]
[2024-06-04 18:02:59,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:59,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:59,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:07,467 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-04 18:03:07,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:07,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308634278]
[2024-06-04 18:03:07,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308634278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:07,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:07,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:03:07,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065302106]
[2024-06-04 18:03:07,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:07,468 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:03:07,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:07,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:03:07,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:03:07,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:03:07,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 326 transitions, 5091 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:07,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:07,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:03:07,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:09,363 INFO  L124   PetriNetUnfolderBase]: 3232/4943 cut-off events.
[2024-06-04 18:03:09,363 INFO  L125   PetriNetUnfolderBase]: For 288463/288471 co-relation queries the response was YES.
[2024-06-04 18:03:09,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41282 conditions, 4943 events. 3232/4943 cut-off events. For 288463/288471 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26468 event pairs, 705 based on Foata normal form. 14/4955 useless extension candidates. Maximal degree in co-relation 41170. Up to 4721 conditions per place. 
[2024-06-04 18:03:09,411 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 301 selfloop transitions, 68 changer transitions 0/372 dead transitions.
[2024-06-04 18:03:09,411 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 372 transitions, 6418 flow
[2024-06-04 18:03:09,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:03:09,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:03:09,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 18:03:09,412 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 18:03:09,412 INFO  L175             Difference]: Start difference. First operand has 223 places, 326 transitions, 5091 flow. Second operand 7 states and 126 transitions.
[2024-06-04 18:03:09,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 372 transitions, 6418 flow
[2024-06-04 18:03:09,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 372 transitions, 6260 flow, removed 78 selfloop flow, removed 1 redundant places.
[2024-06-04 18:03:09,803 INFO  L231             Difference]: Finished difference. Result has 231 places, 348 transitions, 5588 flow
[2024-06-04 18:03:09,803 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4933, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5588, PETRI_PLACES=231, PETRI_TRANSITIONS=348}
[2024-06-04 18:03:09,804 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places.
[2024-06-04 18:03:09,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 348 transitions, 5588 flow
[2024-06-04 18:03:09,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:09,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:09,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:09,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:03:09,804 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:09,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:09,804 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044146580, now seen corresponding path program 1 times
[2024-06-04 18:03:09,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:09,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096629626]
[2024-06-04 18:03:09,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:09,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:09,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:19,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:19,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:19,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096629626]
[2024-06-04 18:03:19,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096629626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:19,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:19,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:03:19,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346793159]
[2024-06-04 18:03:19,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:19,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:03:19,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:19,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:03:19,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:03:19,999 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:03:19,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 348 transitions, 5588 flow. Second operand  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:19,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:19,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:03:19,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:21,658 INFO  L124   PetriNetUnfolderBase]: 3227/4941 cut-off events.
[2024-06-04 18:03:21,658 INFO  L125   PetriNetUnfolderBase]: For 296488/296488 co-relation queries the response was YES.
[2024-06-04 18:03:21,690 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41885 conditions, 4941 events. 3227/4941 cut-off events. For 296488/296488 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26373 event pairs, 762 based on Foata normal form. 2/4941 useless extension candidates. Maximal degree in co-relation 41768. Up to 4894 conditions per place. 
[2024-06-04 18:03:21,709 INFO  L140   encePairwiseOnDemand]: 35/41 looper letters, 341 selfloop transitions, 14 changer transitions 0/358 dead transitions.
[2024-06-04 18:03:21,709 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 358 transitions, 6362 flow
[2024-06-04 18:03:21,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:03:21,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:03:21,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2024-06-04 18:03:21,710 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-04 18:03:21,710 INFO  L175             Difference]: Start difference. First operand has 231 places, 348 transitions, 5588 flow. Second operand 5 states and 81 transitions.
[2024-06-04 18:03:21,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 358 transitions, 6362 flow
[2024-06-04 18:03:22,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 358 transitions, 6215 flow, removed 68 selfloop flow, removed 2 redundant places.
[2024-06-04 18:03:22,277 INFO  L231             Difference]: Finished difference. Result has 234 places, 350 transitions, 5516 flow
[2024-06-04 18:03:22,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5441, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5516, PETRI_PLACES=234, PETRI_TRANSITIONS=350}
[2024-06-04 18:03:22,278 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places.
[2024-06-04 18:03:22,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 5516 flow
[2024-06-04 18:03:22,279 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:22,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:22,279 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:22,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:03:22,279 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-04 18:03:22,279 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:22,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068627935, now seen corresponding path program 1 times
[2024-06-04 18:03:22,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:22,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437951958]
[2024-06-04 18:03:22,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:22,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:22,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:30,463 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-04 18:03:30,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:30,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437951958]
[2024-06-04 18:03:30,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437951958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:30,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:30,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:03:30,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052150388]
[2024-06-04 18:03:30,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:30,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:03:30,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:30,465 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:03:30,465 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:03:30,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:03:30,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 5516 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:30,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:30,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:03:30,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:32,504 INFO  L124   PetriNetUnfolderBase]: 3207/4907 cut-off events.
[2024-06-04 18:03:32,504 INFO  L125   PetriNetUnfolderBase]: For 303655/303667 co-relation queries the response was YES.
[2024-06-04 18:03:32,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41180 conditions, 4907 events. 3207/4907 cut-off events. For 303655/303667 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26096 event pairs, 502 based on Foata normal form. 24/4928 useless extension candidates. Maximal degree in co-relation 41061. Up to 4542 conditions per place. 
[2024-06-04 18:03:32,558 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 326 selfloop transitions, 55 changer transitions 0/384 dead transitions.
[2024-06-04 18:03:32,558 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 384 transitions, 6402 flow
[2024-06-04 18:03:32,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:03:32,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:03:32,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-04 18:03:32,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 18:03:32,560 INFO  L175             Difference]: Start difference. First operand has 234 places, 350 transitions, 5516 flow. Second operand 9 states and 144 transitions.
[2024-06-04 18:03:32,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 384 transitions, 6402 flow
[2024-06-04 18:03:32,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 384 transitions, 6343 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-04 18:03:32,973 INFO  L231             Difference]: Finished difference. Result has 240 places, 350 transitions, 5573 flow
[2024-06-04 18:03:32,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5457, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5573, PETRI_PLACES=240, PETRI_TRANSITIONS=350}
[2024-06-04 18:03:32,973 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places.
[2024-06-04 18:03:32,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 350 transitions, 5573 flow
[2024-06-04 18:03:32,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:32,974 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:32,974 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:32,974 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:03:32,974 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-04 18:03:32,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:32,974 INFO  L85        PathProgramCache]: Analyzing trace with hash -10979679, now seen corresponding path program 2 times
[2024-06-04 18:03:32,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:32,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403954199]
[2024-06-04 18:03:32,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:32,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:33,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:40,974 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-04 18:03:40,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:40,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403954199]
[2024-06-04 18:03:40,975 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403954199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:40,975 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:40,975 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:03:40,975 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219880888]
[2024-06-04 18:03:40,975 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:40,975 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:03:40,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:40,976 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:03:40,976 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:03:41,173 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:03:41,174 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 350 transitions, 5573 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:41,174 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:41,174 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:03:41,174 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:43,163 INFO  L124   PetriNetUnfolderBase]: 3248/4976 cut-off events.
[2024-06-04 18:03:43,163 INFO  L125   PetriNetUnfolderBase]: For 316503/316545 co-relation queries the response was YES.
[2024-06-04 18:03:43,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41983 conditions, 4976 events. 3248/4976 cut-off events. For 316503/316545 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26698 event pairs, 650 based on Foata normal form. 44/5016 useless extension candidates. Maximal degree in co-relation 41863. Up to 4465 conditions per place. 
[2024-06-04 18:03:43,213 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 77 changer transitions 0/385 dead transitions.
[2024-06-04 18:03:43,213 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 385 transitions, 6507 flow
[2024-06-04 18:03:43,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:03:43,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:03:43,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-04 18:03:43,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-04 18:03:43,216 INFO  L175             Difference]: Start difference. First operand has 240 places, 350 transitions, 5573 flow. Second operand 9 states and 147 transitions.
[2024-06-04 18:03:43,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 385 transitions, 6507 flow
[2024-06-04 18:03:43,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 385 transitions, 6284 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-04 18:03:43,697 INFO  L231             Difference]: Finished difference. Result has 241 places, 351 transitions, 5556 flow
[2024-06-04 18:03:43,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5351, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5556, PETRI_PLACES=241, PETRI_TRANSITIONS=351}
[2024-06-04 18:03:43,697 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places.
[2024-06-04 18:03:43,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 351 transitions, 5556 flow
[2024-06-04 18:03:43,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:43,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:43,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:43,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:03:43,698 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-04 18:03:43,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:43,698 INFO  L85        PathProgramCache]: Analyzing trace with hash 792304123, now seen corresponding path program 3 times
[2024-06-04 18:03:43,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:43,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90348305]
[2024-06-04 18:03:43,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:43,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:43,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:51,292 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-04 18:03:51,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:51,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90348305]
[2024-06-04 18:03:51,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90348305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:51,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:51,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:03:51,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355969073]
[2024-06-04 18:03:51,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:51,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:03:51,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:51,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:03:51,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:03:51,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:03:51,445 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 351 transitions, 5556 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:03:51,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:51,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:03:51,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:53,284 INFO  L124   PetriNetUnfolderBase]: 3228/4948 cut-off events.
[2024-06-04 18:03:53,285 INFO  L125   PetriNetUnfolderBase]: For 318423/318455 co-relation queries the response was YES.
[2024-06-04 18:03:53,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40946 conditions, 4948 events. 3228/4948 cut-off events. For 318423/318455 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26443 event pairs, 635 based on Foata normal form. 23/4965 useless extension candidates. Maximal degree in co-relation 40826. Up to 4225 conditions per place. 
[2024-06-04 18:03:53,332 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 118 changer transitions 0/380 dead transitions.
[2024-06-04 18:03:53,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 380 transitions, 6431 flow
[2024-06-04 18:03:53,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:03:53,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:03:53,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:03:53,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4115853658536585
[2024-06-04 18:03:53,334 INFO  L175             Difference]: Start difference. First operand has 241 places, 351 transitions, 5556 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:03:53,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 380 transitions, 6431 flow
[2024-06-04 18:03:53,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 380 transitions, 6221 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-04 18:03:53,810 INFO  L231             Difference]: Finished difference. Result has 243 places, 352 transitions, 5617 flow
[2024-06-04 18:03:53,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5346, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5617, PETRI_PLACES=243, PETRI_TRANSITIONS=352}
[2024-06-04 18:03:53,810 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places.
[2024-06-04 18:03:53,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 352 transitions, 5617 flow
[2024-06-04 18:03:53,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:03:53,810 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:53,810 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:53,811 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:03:53,811 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-04 18:03:53,811 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:53,811 INFO  L85        PathProgramCache]: Analyzing trace with hash 201455432, now seen corresponding path program 1 times
[2024-06-04 18:03:53,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:53,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281801633]
[2024-06-04 18:03:53,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:53,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:53,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:04,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:04,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:04,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281801633]
[2024-06-04 18:04:04,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281801633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:04,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:04,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:04,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166310115]
[2024-06-04 18:04:04,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:04,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:04,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:04,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:04,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:04,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:04:04,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 352 transitions, 5617 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:04:04,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:04,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:04:04,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:06,551 INFO  L124   PetriNetUnfolderBase]: 3248/4976 cut-off events.
[2024-06-04 18:04:06,551 INFO  L125   PetriNetUnfolderBase]: For 316735/316743 co-relation queries the response was YES.
[2024-06-04 18:04:06,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41319 conditions, 4976 events. 3248/4976 cut-off events. For 316735/316743 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26726 event pairs, 670 based on Foata normal form. 12/4986 useless extension candidates. Maximal degree in co-relation 41197. Up to 4677 conditions per place. 
[2024-06-04 18:04:06,609 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 296 selfloop transitions, 86 changer transitions 0/385 dead transitions.
[2024-06-04 18:04:06,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 385 transitions, 6691 flow
[2024-06-04 18:04:06,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:04:06,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:04:06,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-04 18:04:06,611 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4176829268292683
[2024-06-04 18:04:06,612 INFO  L175             Difference]: Start difference. First operand has 243 places, 352 transitions, 5617 flow. Second operand 8 states and 137 transitions.
[2024-06-04 18:04:06,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 385 transitions, 6691 flow
[2024-06-04 18:04:07,113 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 385 transitions, 6431 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-04 18:04:07,118 INFO  L231             Difference]: Finished difference. Result has 245 places, 358 transitions, 5641 flow
[2024-06-04 18:04:07,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5357, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5641, PETRI_PLACES=245, PETRI_TRANSITIONS=358}
[2024-06-04 18:04:07,118 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places.
[2024-06-04 18:04:07,118 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 358 transitions, 5641 flow
[2024-06-04 18:04:07,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:04:07,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:07,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:07,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:04:07,119 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-04 18:04:07,119 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:07,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -726508483, now seen corresponding path program 1 times
[2024-06-04 18:04:07,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:07,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081866270]
[2024-06-04 18:04:07,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:07,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:07,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:15,045 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-04 18:04:15,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:15,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081866270]
[2024-06-04 18:04:15,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081866270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:15,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:15,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:15,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960417897]
[2024-06-04 18:04:15,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:15,046 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:15,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:15,046 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:15,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:15,192 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:04:15,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 358 transitions, 5641 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:15,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:15,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:04:15,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:16,831 INFO  L124   PetriNetUnfolderBase]: 3261/4989 cut-off events.
[2024-06-04 18:04:16,832 INFO  L125   PetriNetUnfolderBase]: For 323969/323977 co-relation queries the response was YES.
[2024-06-04 18:04:16,870 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41720 conditions, 4989 events. 3261/4989 cut-off events. For 323969/323977 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26709 event pairs, 688 based on Foata normal form. 9/4996 useless extension candidates. Maximal degree in co-relation 41597. Up to 4890 conditions per place. 
[2024-06-04 18:04:17,013 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 340 selfloop transitions, 41 changer transitions 0/384 dead transitions.
[2024-06-04 18:04:17,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 384 transitions, 6713 flow
[2024-06-04 18:04:17,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:04:17,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:04:17,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions.
[2024-06-04 18:04:17,014 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3604336043360434
[2024-06-04 18:04:17,015 INFO  L175             Difference]: Start difference. First operand has 245 places, 358 transitions, 5641 flow. Second operand 9 states and 133 transitions.
[2024-06-04 18:04:17,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 384 transitions, 6713 flow
[2024-06-04 18:04:17,564 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 384 transitions, 6605 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-04 18:04:17,568 INFO  L231             Difference]: Finished difference. Result has 250 places, 364 transitions, 5767 flow
[2024-06-04 18:04:17,569 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5533, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5767, PETRI_PLACES=250, PETRI_TRANSITIONS=364}
[2024-06-04 18:04:17,569 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places.
[2024-06-04 18:04:17,569 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 364 transitions, 5767 flow
[2024-06-04 18:04:17,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:17,569 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:17,569 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:17,569 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:04:17,569 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:17,570 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:17,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -720794563, now seen corresponding path program 2 times
[2024-06-04 18:04:17,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:17,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559366892]
[2024-06-04 18:04:17,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:17,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:17,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:25,242 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-04 18:04:25,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:25,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559366892]
[2024-06-04 18:04:25,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559366892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:25,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:25,243 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:25,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376301616]
[2024-06-04 18:04:25,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:25,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:25,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:25,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:25,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:25,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:04:25,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 364 transitions, 5767 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:25,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:25,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:04:25,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:27,138 INFO  L124   PetriNetUnfolderBase]: 3258/4985 cut-off events.
[2024-06-04 18:04:27,138 INFO  L125   PetriNetUnfolderBase]: For 332170/332178 co-relation queries the response was YES.
[2024-06-04 18:04:27,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41768 conditions, 4985 events. 3258/4985 cut-off events. For 332170/332178 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26741 event pairs, 689 based on Foata normal form. 9/4992 useless extension candidates. Maximal degree in co-relation 41643. Up to 4920 conditions per place. 
[2024-06-04 18:04:27,188 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 350 selfloop transitions, 25 changer transitions 0/378 dead transitions.
[2024-06-04 18:04:27,189 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 378 transitions, 6565 flow
[2024-06-04 18:04:27,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:27,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:27,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-04 18:04:27,190 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37630662020905925
[2024-06-04 18:04:27,190 INFO  L175             Difference]: Start difference. First operand has 250 places, 364 transitions, 5767 flow. Second operand 7 states and 108 transitions.
[2024-06-04 18:04:27,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 378 transitions, 6565 flow
[2024-06-04 18:04:27,831 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 378 transitions, 6444 flow, removed 51 selfloop flow, removed 3 redundant places.
[2024-06-04 18:04:27,836 INFO  L231             Difference]: Finished difference. Result has 254 places, 364 transitions, 5702 flow
[2024-06-04 18:04:27,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5702, PETRI_PLACES=254, PETRI_TRANSITIONS=364}
[2024-06-04 18:04:27,836 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-04 18:04:27,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 364 transitions, 5702 flow
[2024-06-04 18:04:27,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:27,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:27,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:27,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:04:27,837 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-04 18:04:27,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:27,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -197424701, now seen corresponding path program 4 times
[2024-06-04 18:04:27,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:27,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336328413]
[2024-06-04 18:04:27,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:27,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:27,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:35,850 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-04 18:04:35,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:35,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336328413]
[2024-06-04 18:04:35,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336328413] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:35,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:35,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:04:35,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528682615]
[2024-06-04 18:04:35,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:35,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:04:35,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:35,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:04:35,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:04:36,026 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:04:36,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 364 transitions, 5702 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:36,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:36,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:04:36,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:37,923 INFO  L124   PetriNetUnfolderBase]: 3238/4957 cut-off events.
[2024-06-04 18:04:37,924 INFO  L125   PetriNetUnfolderBase]: For 343166/343168 co-relation queries the response was YES.
[2024-06-04 18:04:37,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41172 conditions, 4957 events. 3238/4957 cut-off events. For 343166/343168 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26491 event pairs, 623 based on Foata normal form. 14/4966 useless extension candidates. Maximal degree in co-relation 41045. Up to 4147 conditions per place. 
[2024-06-04 18:04:37,973 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 283 selfloop transitions, 112 changer transitions 0/398 dead transitions.
[2024-06-04 18:04:37,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 398 transitions, 6633 flow
[2024-06-04 18:04:37,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:04:37,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:04:37,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 18:04:37,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-04 18:04:37,974 INFO  L175             Difference]: Start difference. First operand has 254 places, 364 transitions, 5702 flow. Second operand 9 states and 149 transitions.
[2024-06-04 18:04:37,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 398 transitions, 6633 flow
[2024-06-04 18:04:38,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 398 transitions, 6571 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-04 18:04:38,638 INFO  L231             Difference]: Finished difference. Result has 259 places, 365 transitions, 5908 flow
[2024-06-04 18:04:38,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5640, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5908, PETRI_PLACES=259, PETRI_TRANSITIONS=365}
[2024-06-04 18:04:38,638 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-04 18:04:38,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 365 transitions, 5908 flow
[2024-06-04 18:04:38,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:38,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:38,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:38,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:04:38,639 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:38,640 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:38,640 INFO  L85        PathProgramCache]: Analyzing trace with hash -633595960, now seen corresponding path program 2 times
[2024-06-04 18:04:38,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:38,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703401631]
[2024-06-04 18:04:38,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:38,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:38,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:50,242 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-04 18:04:50,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:50,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703401631]
[2024-06-04 18:04:50,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703401631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:50,243 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:50,243 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:50,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092416189]
[2024-06-04 18:04:50,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:50,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:50,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:50,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:50,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:50,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:04:50,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 365 transitions, 5908 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:04:50,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:50,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:04:50,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:52,354 INFO  L124   PetriNetUnfolderBase]: 3290/5026 cut-off events.
[2024-06-04 18:04:52,355 INFO  L125   PetriNetUnfolderBase]: For 353836/353836 co-relation queries the response was YES.
[2024-06-04 18:04:52,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42613 conditions, 5026 events. 3290/5026 cut-off events. For 353836/353836 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26836 event pairs, 653 based on Foata normal form. 4/5028 useless extension candidates. Maximal degree in co-relation 42484. Up to 4699 conditions per place. 
[2024-06-04 18:04:52,408 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 88 changer transitions 0/396 dead transitions.
[2024-06-04 18:04:52,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 396 transitions, 7108 flow
[2024-06-04 18:04:52,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:04:52,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:04:52,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-04 18:04:52,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:04:52,411 INFO  L175             Difference]: Start difference. First operand has 259 places, 365 transitions, 5908 flow. Second operand 8 states and 136 transitions.
[2024-06-04 18:04:52,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 396 transitions, 7108 flow
[2024-06-04 18:04:53,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 396 transitions, 6653 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-04 18:04:53,188 INFO  L231             Difference]: Finished difference. Result has 259 places, 371 transitions, 5727 flow
[2024-06-04 18:04:53,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5453, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5727, PETRI_PLACES=259, PETRI_TRANSITIONS=371}
[2024-06-04 18:04:53,188 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-04 18:04:53,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 371 transitions, 5727 flow
[2024-06-04 18:04:53,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:04:53,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:53,189 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:53,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:04:53,189 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:53,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:53,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -1902230870, now seen corresponding path program 3 times
[2024-06-04 18:04:53,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:53,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547805973]
[2024-06-04 18:04:53,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:53,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:53,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:04,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:04,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:04,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547805973]
[2024-06-04 18:05:04,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547805973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:04,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:04,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:04,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978268553]
[2024-06-04 18:05:04,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:04,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:04,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:04,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:04,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:04,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:05:04,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 371 transitions, 5727 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:05:04,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:04,647 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:05:04,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:06,581 INFO  L124   PetriNetUnfolderBase]: 3278/5010 cut-off events.
[2024-06-04 18:05:06,581 INFO  L125   PetriNetUnfolderBase]: For 354276/354276 co-relation queries the response was YES.
[2024-06-04 18:05:06,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41162 conditions, 5010 events. 3278/5010 cut-off events. For 354276/354276 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26779 event pairs, 651 based on Foata normal form. 4/5012 useless extension candidates. Maximal degree in co-relation 41034. Up to 4691 conditions per place. 
[2024-06-04 18:05:06,631 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 302 selfloop transitions, 89 changer transitions 0/394 dead transitions.
[2024-06-04 18:05:06,631 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 394 transitions, 6713 flow
[2024-06-04 18:05:06,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:05:06,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:05:06,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-04 18:05:06,633 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-04 18:05:06,633 INFO  L175             Difference]: Start difference. First operand has 259 places, 371 transitions, 5727 flow. Second operand 8 states and 133 transitions.
[2024-06-04 18:05:06,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 394 transitions, 6713 flow
[2024-06-04 18:05:07,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 394 transitions, 6551 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-04 18:05:07,206 INFO  L231             Difference]: Finished difference. Result has 263 places, 371 transitions, 5749 flow
[2024-06-04 18:05:07,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5565, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5749, PETRI_PLACES=263, PETRI_TRANSITIONS=371}
[2024-06-04 18:05:07,206 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places.
[2024-06-04 18:05:07,206 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 371 transitions, 5749 flow
[2024-06-04 18:05:07,207 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:05:07,207 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:07,207 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:07,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:05:07,207 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:07,207 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:07,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -483070665, now seen corresponding path program 3 times
[2024-06-04 18:05:07,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:07,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951417983]
[2024-06-04 18:05:07,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:07,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:07,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:15,168 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-04 18:05:15,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:15,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951417983]
[2024-06-04 18:05:15,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951417983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:15,168 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:15,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:15,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309976742]
[2024-06-04 18:05:15,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:15,169 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:15,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:15,169 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:15,169 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:15,327 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:05:15,328 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 371 transitions, 5749 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:15,328 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:15,328 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:05:15,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:16,951 INFO  L124   PetriNetUnfolderBase]: 3280/5012 cut-off events.
[2024-06-04 18:05:16,951 INFO  L125   PetriNetUnfolderBase]: For 361340/361352 co-relation queries the response was YES.
[2024-06-04 18:05:16,987 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41192 conditions, 5012 events. 3280/5012 cut-off events. For 361340/361352 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26785 event pairs, 682 based on Foata normal form. 14/5023 useless extension candidates. Maximal degree in co-relation 41063. Up to 4794 conditions per place. 
[2024-06-04 18:05:17,005 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 325 selfloop transitions, 67 changer transitions 0/395 dead transitions.
[2024-06-04 18:05:17,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 395 transitions, 6934 flow
[2024-06-04 18:05:17,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:17,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:17,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-04 18:05:17,007 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-04 18:05:17,007 INFO  L175             Difference]: Start difference. First operand has 263 places, 371 transitions, 5749 flow. Second operand 7 states and 116 transitions.
[2024-06-04 18:05:17,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 395 transitions, 6934 flow
[2024-06-04 18:05:17,552 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 395 transitions, 6748 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-04 18:05:17,557 INFO  L231             Difference]: Finished difference. Result has 264 places, 378 transitions, 5864 flow
[2024-06-04 18:05:17,557 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5563, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5864, PETRI_PLACES=264, PETRI_TRANSITIONS=378}
[2024-06-04 18:05:17,557 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places.
[2024-06-04 18:05:17,558 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 378 transitions, 5864 flow
[2024-06-04 18:05:17,558 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:17,558 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:17,558 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:17,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:05:17,558 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:17,558 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:17,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -1763733503, now seen corresponding path program 4 times
[2024-06-04 18:05:17,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:17,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432155350]
[2024-06-04 18:05:17,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:17,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:17,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:25,522 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-04 18:05:25,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:25,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432155350]
[2024-06-04 18:05:25,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432155350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:25,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:25,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:25,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739626842]
[2024-06-04 18:05:25,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:25,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:25,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:25,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:25,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:25,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:05:25,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 378 transitions, 5864 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:25,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:25,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:05:25,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:27,381 INFO  L124   PetriNetUnfolderBase]: 3256/4984 cut-off events.
[2024-06-04 18:05:27,381 INFO  L125   PetriNetUnfolderBase]: For 368620/368620 co-relation queries the response was YES.
[2024-06-04 18:05:27,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40833 conditions, 4984 events. 3256/4984 cut-off events. For 368620/368620 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26722 event pairs, 724 based on Foata normal form. 6/4988 useless extension candidates. Maximal degree in co-relation 40702. Up to 4863 conditions per place. 
[2024-06-04 18:05:27,440 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 346 selfloop transitions, 46 changer transitions 0/395 dead transitions.
[2024-06-04 18:05:27,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 395 transitions, 6724 flow
[2024-06-04 18:05:27,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:05:27,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:05:27,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-04 18:05:27,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 18:05:27,441 INFO  L175             Difference]: Start difference. First operand has 264 places, 378 transitions, 5864 flow. Second operand 8 states and 128 transitions.
[2024-06-04 18:05:27,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 395 transitions, 6724 flow
[2024-06-04 18:05:28,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 395 transitions, 6466 flow, removed 97 selfloop flow, removed 3 redundant places.
[2024-06-04 18:05:28,062 INFO  L231             Difference]: Finished difference. Result has 269 places, 378 transitions, 5712 flow
[2024-06-04 18:05:28,062 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5606, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=269, PETRI_TRANSITIONS=378}
[2024-06-04 18:05:28,063 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places.
[2024-06-04 18:05:28,063 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 378 transitions, 5712 flow
[2024-06-04 18:05:28,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:28,063 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:28,063 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:28,063 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:05:28,064 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:28,064 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:28,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063606881, now seen corresponding path program 5 times
[2024-06-04 18:05:28,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:28,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749889853]
[2024-06-04 18:05:28,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:28,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:28,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:35,720 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-04 18:05:35,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:35,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749889853]
[2024-06-04 18:05:35,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749889853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:35,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:35,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:35,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237880340]
[2024-06-04 18:05:35,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:35,721 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:35,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:35,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:35,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:35,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:05:35,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 378 transitions, 5712 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:35,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:35,827 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:05:35,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:37,528 INFO  L124   PetriNetUnfolderBase]: 3232/4946 cut-off events.
[2024-06-04 18:05:37,528 INFO  L125   PetriNetUnfolderBase]: For 365016/365024 co-relation queries the response was YES.
[2024-06-04 18:05:37,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40044 conditions, 4946 events. 3232/4946 cut-off events. For 365016/365024 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26489 event pairs, 674 based on Foata normal form. 14/4958 useless extension candidates. Maximal degree in co-relation 39912. Up to 4736 conditions per place. 
[2024-06-04 18:05:37,587 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 334 selfloop transitions, 64 changer transitions 0/401 dead transitions.
[2024-06-04 18:05:37,587 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 401 transitions, 6612 flow
[2024-06-04 18:05:37,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:37,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:37,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-04 18:05:37,588 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4355400696864111
[2024-06-04 18:05:37,588 INFO  L175             Difference]: Start difference. First operand has 269 places, 378 transitions, 5712 flow. Second operand 7 states and 125 transitions.
[2024-06-04 18:05:37,588 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 401 transitions, 6612 flow
[2024-06-04 18:05:38,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 401 transitions, 6424 flow, removed 45 selfloop flow, removed 7 redundant places.
[2024-06-04 18:05:38,459 INFO  L231             Difference]: Finished difference. Result has 270 places, 379 transitions, 5725 flow
[2024-06-04 18:05:38,459 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5526, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5725, PETRI_PLACES=270, PETRI_TRANSITIONS=379}
[2024-06-04 18:05:38,460 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places.
[2024-06-04 18:05:38,460 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 379 transitions, 5725 flow
[2024-06-04 18:05:38,460 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:38,460 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:38,460 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:38,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:05:38,461 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:38,461 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:38,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092822025, now seen corresponding path program 5 times
[2024-06-04 18:05:38,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:38,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361179693]
[2024-06-04 18:05:38,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:38,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:38,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:45,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:45,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:45,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361179693]
[2024-06-04 18:05:45,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361179693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:45,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:45,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:05:45,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058816926]
[2024-06-04 18:05:45,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:45,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:05:45,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:45,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:05:45,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:05:45,883 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:05:45,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 379 transitions, 5725 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:45,884 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:45,884 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:05:45,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:47,687 INFO  L124   PetriNetUnfolderBase]: 3212/4918 cut-off events.
[2024-06-04 18:05:47,687 INFO  L125   PetriNetUnfolderBase]: For 366800/366802 co-relation queries the response was YES.
[2024-06-04 18:05:47,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39502 conditions, 4918 events. 3212/4918 cut-off events. For 366800/366802 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26233 event pairs, 621 based on Foata normal form. 14/4927 useless extension candidates. Maximal degree in co-relation 39368. Up to 4239 conditions per place. 
[2024-06-04 18:05:47,738 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 304 selfloop transitions, 99 changer transitions 0/406 dead transitions.
[2024-06-04 18:05:47,738 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 406 transitions, 6553 flow
[2024-06-04 18:05:47,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:05:47,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:05:47,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:05:47,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4115853658536585
[2024-06-04 18:05:47,741 INFO  L175             Difference]: Start difference. First operand has 270 places, 379 transitions, 5725 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:05:47,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 406 transitions, 6553 flow
[2024-06-04 18:05:48,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 406 transitions, 6422 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-06-04 18:05:48,494 INFO  L231             Difference]: Finished difference. Result has 272 places, 378 transitions, 5712 flow
[2024-06-04 18:05:48,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5510, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=272, PETRI_TRANSITIONS=378}
[2024-06-04 18:05:48,494 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places.
[2024-06-04 18:05:48,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 378 transitions, 5712 flow
[2024-06-04 18:05:48,495 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:48,495 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:48,495 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:48,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:05:48,495 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-04 18:05:48,496 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:48,496 INFO  L85        PathProgramCache]: Analyzing trace with hash -205086924, now seen corresponding path program 4 times
[2024-06-04 18:05:48,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:48,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015242821]
[2024-06-04 18:05:48,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:48,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:48,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:59,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:59,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:59,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015242821]
[2024-06-04 18:05:59,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015242821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:59,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:59,256 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:59,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616320728]
[2024-06-04 18:05:59,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:59,256 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:59,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:59,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:59,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:59,409 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:05:59,409 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 378 transitions, 5712 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:05:59,409 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:59,409 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:05:59,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:01,084 INFO  L124   PetriNetUnfolderBase]: 3232/4943 cut-off events.
[2024-06-04 18:06:01,084 INFO  L125   PetriNetUnfolderBase]: For 347003/347003 co-relation queries the response was YES.
[2024-06-04 18:06:01,124 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39509 conditions, 4943 events. 3232/4943 cut-off events. For 347003/347003 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26347 event pairs, 633 based on Foata normal form. 4/4945 useless extension candidates. Maximal degree in co-relation 39375. Up to 4707 conditions per place. 
[2024-06-04 18:06:01,141 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 323 selfloop transitions, 76 changer transitions 0/402 dead transitions.
[2024-06-04 18:06:01,142 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 402 transitions, 6763 flow
[2024-06-04 18:06:01,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:01,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:01,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 18:06:01,143 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:06:01,143 INFO  L175             Difference]: Start difference. First operand has 272 places, 378 transitions, 5712 flow. Second operand 7 states and 119 transitions.
[2024-06-04 18:06:01,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 402 transitions, 6763 flow
[2024-06-04 18:06:01,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 402 transitions, 6543 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 18:06:01,737 INFO  L231             Difference]: Finished difference. Result has 273 places, 381 transitions, 5699 flow
[2024-06-04 18:06:01,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5492, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5699, PETRI_PLACES=273, PETRI_TRANSITIONS=381}
[2024-06-04 18:06:01,738 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places.
[2024-06-04 18:06:01,738 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 381 transitions, 5699 flow
[2024-06-04 18:06:01,738 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:06:01,738 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:01,738 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:01,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:06:01,738 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-04 18:06:01,739 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:01,739 INFO  L85        PathProgramCache]: Analyzing trace with hash -210449898, now seen corresponding path program 5 times
[2024-06-04 18:06:01,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:01,739 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945815919]
[2024-06-04 18:06:01,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:01,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:01,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:13,114 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-04 18:06:13,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:13,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945815919]
[2024-06-04 18:06:13,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945815919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:13,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:13,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:13,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619565500]
[2024-06-04 18:06:13,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:13,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:13,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:13,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:13,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:13,256 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:06:13,256 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 381 transitions, 5699 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:06:13,256 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:13,256 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:06:13,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:14,928 INFO  L124   PetriNetUnfolderBase]: 3220/4931 cut-off events.
[2024-06-04 18:06:14,928 INFO  L125   PetriNetUnfolderBase]: For 348608/348616 co-relation queries the response was YES.
[2024-06-04 18:06:14,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39078 conditions, 4931 events. 3220/4931 cut-off events. For 348608/348616 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26414 event pairs, 636 based on Foata normal form. 12/4941 useless extension candidates. Maximal degree in co-relation 38943. Up to 4699 conditions per place. 
[2024-06-04 18:06:14,985 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 321 selfloop transitions, 81 changer transitions 0/405 dead transitions.
[2024-06-04 18:06:14,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 405 transitions, 6603 flow
[2024-06-04 18:06:14,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:14,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:14,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 18:06:14,986 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 18:06:14,987 INFO  L175             Difference]: Start difference. First operand has 273 places, 381 transitions, 5699 flow. Second operand 7 states and 123 transitions.
[2024-06-04 18:06:14,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 405 transitions, 6603 flow
[2024-06-04 18:06:15,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 405 transitions, 6335 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-04 18:06:15,665 INFO  L231             Difference]: Finished difference. Result has 275 places, 381 transitions, 5600 flow
[2024-06-04 18:06:15,666 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5431, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5600, PETRI_PLACES=275, PETRI_TRANSITIONS=381}
[2024-06-04 18:06:15,666 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places.
[2024-06-04 18:06:15,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 381 transitions, 5600 flow
[2024-06-04 18:06:15,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:06:15,666 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:15,667 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:15,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:06:15,667 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:15,667 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:15,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -486486059, now seen corresponding path program 1 times
[2024-06-04 18:06:15,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:15,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445676541]
[2024-06-04 18:06:15,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:15,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:15,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:24,411 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-04 18:06:24,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:24,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445676541]
[2024-06-04 18:06:24,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445676541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:24,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:24,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:06:24,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213367944]
[2024-06-04 18:06:24,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:24,412 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:06:24,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:24,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:06:24,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:06:24,606 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:06:24,606 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 381 transitions, 5600 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:24,607 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:24,607 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:06:24,607 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:26,366 INFO  L124   PetriNetUnfolderBase]: 3238/4952 cut-off events.
[2024-06-04 18:06:26,367 INFO  L125   PetriNetUnfolderBase]: For 354578/354617 co-relation queries the response was YES.
[2024-06-04 18:06:26,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39333 conditions, 4952 events. 3238/4952 cut-off events. For 354578/354617 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26433 event pairs, 655 based on Foata normal form. 32/4980 useless extension candidates. Maximal degree in co-relation 39197. Up to 4696 conditions per place. 
[2024-06-04 18:06:26,418 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 321 selfloop transitions, 89 changer transitions 0/413 dead transitions.
[2024-06-04 18:06:26,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 413 transitions, 7004 flow
[2024-06-04 18:06:26,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:06:26,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:06:26,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-04 18:06:26,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-04 18:06:26,420 INFO  L175             Difference]: Start difference. First operand has 275 places, 381 transitions, 5600 flow. Second operand 10 states and 155 transitions.
[2024-06-04 18:06:26,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 413 transitions, 7004 flow
[2024-06-04 18:06:26,818 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 413 transitions, 6775 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-04 18:06:26,823 INFO  L231             Difference]: Finished difference. Result has 278 places, 389 transitions, 5701 flow
[2024-06-04 18:06:26,823 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5371, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5701, PETRI_PLACES=278, PETRI_TRANSITIONS=389}
[2024-06-04 18:06:26,823 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 236 predicate places.
[2024-06-04 18:06:26,824 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 389 transitions, 5701 flow
[2024-06-04 18:06:26,824 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:26,824 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:26,824 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:26,824 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 18:06:26,824 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:26,824 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:26,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 477318202, now seen corresponding path program 1 times
[2024-06-04 18:06:26,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:26,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476568690]
[2024-06-04 18:06:26,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:26,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:26,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:35,347 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-04 18:06:35,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:35,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476568690]
[2024-06-04 18:06:35,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476568690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:35,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:35,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:06:35,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935194564]
[2024-06-04 18:06:35,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:35,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:06:35,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:35,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:06:35,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:06:35,512 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:06:35,512 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 389 transitions, 5701 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:35,512 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:35,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:06:35,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:37,158 INFO  L124   PetriNetUnfolderBase]: 3298/5034 cut-off events.
[2024-06-04 18:06:37,158 INFO  L125   PetriNetUnfolderBase]: For 378827/378839 co-relation queries the response was YES.
[2024-06-04 18:06:37,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41131 conditions, 5034 events. 3298/5034 cut-off events. For 378827/378839 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26879 event pairs, 640 based on Foata normal form. 16/5047 useless extension candidates. Maximal degree in co-relation 40994. Up to 4618 conditions per place. 
[2024-06-04 18:06:37,216 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 316 selfloop transitions, 109 changer transitions 0/428 dead transitions.
[2024-06-04 18:06:37,216 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 428 transitions, 7227 flow
[2024-06-04 18:06:37,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:06:37,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:06:37,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-04 18:06:37,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 18:06:37,217 INFO  L175             Difference]: Start difference. First operand has 278 places, 389 transitions, 5701 flow. Second operand 9 states and 144 transitions.
[2024-06-04 18:06:37,217 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 428 transitions, 7227 flow
[2024-06-04 18:06:37,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 428 transitions, 7034 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-04 18:06:37,747 INFO  L231             Difference]: Finished difference. Result has 283 places, 406 transitions, 6181 flow
[2024-06-04 18:06:37,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5508, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6181, PETRI_PLACES=283, PETRI_TRANSITIONS=406}
[2024-06-04 18:06:37,748 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places.
[2024-06-04 18:06:37,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 406 transitions, 6181 flow
[2024-06-04 18:06:37,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:37,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:37,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:37,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 18:06:37,748 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:37,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:37,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 481037117, now seen corresponding path program 2 times
[2024-06-04 18:06:37,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:37,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756100880]
[2024-06-04 18:06:37,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:37,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:37,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:46,360 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-04 18:06:46,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:46,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756100880]
[2024-06-04 18:06:46,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756100880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:46,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:46,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:06:46,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399913208]
[2024-06-04 18:06:46,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:46,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:06:46,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:46,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:06:46,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:06:46,517 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:06:46,517 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 406 transitions, 6181 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:46,517 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:46,517 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:06:46,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:48,418 INFO  L124   PetriNetUnfolderBase]: 3514/5339 cut-off events.
[2024-06-04 18:06:48,418 INFO  L125   PetriNetUnfolderBase]: For 449490/449490 co-relation queries the response was YES.
[2024-06-04 18:06:48,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45800 conditions, 5339 events. 3514/5339 cut-off events. For 449490/449490 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28543 event pairs, 702 based on Foata normal form. 12/5349 useless extension candidates. Maximal degree in co-relation 45659. Up to 5040 conditions per place. 
[2024-06-04 18:06:48,487 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 384 selfloop transitions, 62 changer transitions 0/449 dead transitions.
[2024-06-04 18:06:48,487 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 449 transitions, 7791 flow
[2024-06-04 18:06:48,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:06:48,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:06:48,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 18:06:48,488 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-04 18:06:48,488 INFO  L175             Difference]: Start difference. First operand has 283 places, 406 transitions, 6181 flow. Second operand 9 states and 149 transitions.
[2024-06-04 18:06:48,488 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 449 transitions, 7791 flow
[2024-06-04 18:06:49,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 449 transitions, 7625 flow, removed 74 selfloop flow, removed 3 redundant places.
[2024-06-04 18:06:49,235 INFO  L231             Difference]: Finished difference. Result has 290 places, 425 transitions, 6547 flow
[2024-06-04 18:06:49,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6029, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6547, PETRI_PLACES=290, PETRI_TRANSITIONS=425}
[2024-06-04 18:06:49,236 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places.
[2024-06-04 18:06:49,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 290 places, 425 transitions, 6547 flow
[2024-06-04 18:06:49,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:49,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:49,236 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:49,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 18:06:49,236 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:49,236 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:49,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 481037272, now seen corresponding path program 2 times
[2024-06-04 18:06:49,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:49,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774015871]
[2024-06-04 18:06:49,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:49,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:49,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:57,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:57,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:57,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774015871]
[2024-06-04 18:06:57,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774015871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:57,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:57,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:06:57,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601053910]
[2024-06-04 18:06:57,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:57,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:06:57,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:57,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:06:57,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:06:57,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:06:57,737 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 425 transitions, 6547 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:57,737 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:57,737 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:06:57,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:59,732 INFO  L124   PetriNetUnfolderBase]: 3582/5433 cut-off events.
[2024-06-04 18:06:59,732 INFO  L125   PetriNetUnfolderBase]: For 463048/463048 co-relation queries the response was YES.
[2024-06-04 18:06:59,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47942 conditions, 5433 events. 3582/5433 cut-off events. For 463048/463048 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29093 event pairs, 721 based on Foata normal form. 4/5435 useless extension candidates. Maximal degree in co-relation 47798. Up to 5265 conditions per place. 
[2024-06-04 18:06:59,795 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 397 selfloop transitions, 57 changer transitions 0/457 dead transitions.
[2024-06-04 18:06:59,795 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 457 transitions, 8076 flow
[2024-06-04 18:06:59,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:06:59,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:06:59,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-04 18:06:59,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-04 18:06:59,796 INFO  L175             Difference]: Start difference. First operand has 290 places, 425 transitions, 6547 flow. Second operand 9 states and 142 transitions.
[2024-06-04 18:06:59,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 457 transitions, 8076 flow
[2024-06-04 18:07:00,415 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 457 transitions, 7861 flow, removed 89 selfloop flow, removed 4 redundant places.
[2024-06-04 18:07:00,421 INFO  L231             Difference]: Finished difference. Result has 296 places, 436 transitions, 6750 flow
[2024-06-04 18:07:00,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6332, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6750, PETRI_PLACES=296, PETRI_TRANSITIONS=436}
[2024-06-04 18:07:00,422 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places.
[2024-06-04 18:07:00,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 296 places, 436 transitions, 6750 flow
[2024-06-04 18:07:00,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:00,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:00,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:00,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 18:07:00,423 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:00,423 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:00,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -38484900, now seen corresponding path program 3 times
[2024-06-04 18:07:00,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:00,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937113092]
[2024-06-04 18:07:00,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:00,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:00,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:08,223 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-04 18:07:08,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:08,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937113092]
[2024-06-04 18:07:08,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937113092] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:08,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:08,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:08,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664837691]
[2024-06-04 18:07:08,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:08,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:08,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:08,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:08,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:08,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:07:08,343 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 436 transitions, 6750 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:07:08,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:08,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:07:08,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:10,263 INFO  L124   PetriNetUnfolderBase]: 3638/5511 cut-off events.
[2024-06-04 18:07:10,263 INFO  L125   PetriNetUnfolderBase]: For 483212/483212 co-relation queries the response was YES.
[2024-06-04 18:07:10,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48957 conditions, 5511 events. 3638/5511 cut-off events. For 483212/483212 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29517 event pairs, 729 based on Foata normal form. 4/5513 useless extension candidates. Maximal degree in co-relation 48810. Up to 5367 conditions per place. 
[2024-06-04 18:07:10,329 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 416 selfloop transitions, 43 changer transitions 0/462 dead transitions.
[2024-06-04 18:07:10,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 462 transitions, 8097 flow
[2024-06-04 18:07:10,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:10,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:10,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-04 18:07:10,332 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-04 18:07:10,332 INFO  L175             Difference]: Start difference. First operand has 296 places, 436 transitions, 6750 flow. Second operand 8 states and 124 transitions.
[2024-06-04 18:07:10,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 462 transitions, 8097 flow
[2024-06-04 18:07:11,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 462 transitions, 7954 flow, removed 53 selfloop flow, removed 4 redundant places.
[2024-06-04 18:07:11,279 INFO  L231             Difference]: Finished difference. Result has 301 places, 444 transitions, 6948 flow
[2024-06-04 18:07:11,279 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6607, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6948, PETRI_PLACES=301, PETRI_TRANSITIONS=444}
[2024-06-04 18:07:11,280 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places.
[2024-06-04 18:07:11,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 444 transitions, 6948 flow
[2024-06-04 18:07:11,280 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:07:11,280 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:11,280 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:11,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 18:07:11,280 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:11,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:11,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063598790, now seen corresponding path program 4 times
[2024-06-04 18:07:11,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:11,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490053833]
[2024-06-04 18:07:11,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:11,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:11,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:18,533 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-04 18:07:18,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:18,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490053833]
[2024-06-04 18:07:18,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490053833] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:18,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:18,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:18,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828030865]
[2024-06-04 18:07:18,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:18,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:18,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:18,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:18,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:18,701 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:07:18,702 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 444 transitions, 6948 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:07:18,702 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:18,702 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:07:18,702 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:20,732 INFO  L124   PetriNetUnfolderBase]: 3690/5578 cut-off events.
[2024-06-04 18:07:20,732 INFO  L125   PetriNetUnfolderBase]: For 505429/505437 co-relation queries the response was YES.
[2024-06-04 18:07:20,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50322 conditions, 5578 events. 3690/5578 cut-off events. For 505429/505437 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 29833 event pairs, 720 based on Foata normal form. 12/5588 useless extension candidates. Maximal degree in co-relation 50172. Up to 5267 conditions per place. 
[2024-06-04 18:07:20,802 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 389 selfloop transitions, 89 changer transitions 0/481 dead transitions.
[2024-06-04 18:07:20,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 481 transitions, 8571 flow
[2024-06-04 18:07:20,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:20,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:20,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-04 18:07:20,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-04 18:07:20,803 INFO  L175             Difference]: Start difference. First operand has 301 places, 444 transitions, 6948 flow. Second operand 8 states and 139 transitions.
[2024-06-04 18:07:20,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 481 transitions, 8571 flow
[2024-06-04 18:07:21,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 481 transitions, 8339 flow, removed 64 selfloop flow, removed 5 redundant places.
[2024-06-04 18:07:21,931 INFO  L231             Difference]: Finished difference. Result has 306 places, 455 transitions, 7282 flow
[2024-06-04 18:07:21,932 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6716, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7282, PETRI_PLACES=306, PETRI_TRANSITIONS=455}
[2024-06-04 18:07:21,932 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places.
[2024-06-04 18:07:21,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 455 transitions, 7282 flow
[2024-06-04 18:07:21,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-04 18:07:21,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:21,933 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:21,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 18:07:21,933 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:21,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:21,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063598945, now seen corresponding path program 3 times
[2024-06-04 18:07:21,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:21,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503474605]
[2024-06-04 18:07:21,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:21,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:21,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:30,576 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-04 18:07:30,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:30,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503474605]
[2024-06-04 18:07:30,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503474605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:30,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:30,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:07:30,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734327326]
[2024-06-04 18:07:30,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:30,576 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:07:30,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:30,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:07:30,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:07:30,730 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:07:30,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 455 transitions, 7282 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:30,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:30,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:07:30,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:32,923 INFO  L124   PetriNetUnfolderBase]: 3734/5640 cut-off events.
[2024-06-04 18:07:32,923 INFO  L125   PetriNetUnfolderBase]: For 531297/531305 co-relation queries the response was YES.
[2024-06-04 18:07:32,969 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51148 conditions, 5640 events. 3734/5640 cut-off events. For 531297/531305 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30232 event pairs, 723 based on Foata normal form. 16/5654 useless extension candidates. Maximal degree in co-relation 50997. Up to 5356 conditions per place. 
[2024-06-04 18:07:32,992 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 396 selfloop transitions, 99 changer transitions 0/498 dead transitions.
[2024-06-04 18:07:32,992 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 498 transitions, 8878 flow
[2024-06-04 18:07:32,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:32,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:32,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-04 18:07:32,994 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-04 18:07:32,994 INFO  L175             Difference]: Start difference. First operand has 306 places, 455 transitions, 7282 flow. Second operand 8 states and 146 transitions.
[2024-06-04 18:07:32,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 498 transitions, 8878 flow
[2024-06-04 18:07:33,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 498 transitions, 8731 flow, removed 68 selfloop flow, removed 2 redundant places.
[2024-06-04 18:07:33,921 INFO  L231             Difference]: Finished difference. Result has 314 places, 470 transitions, 7805 flow
[2024-06-04 18:07:33,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7135, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7805, PETRI_PLACES=314, PETRI_TRANSITIONS=470}
[2024-06-04 18:07:33,922 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 272 predicate places.
[2024-06-04 18:07:33,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 470 transitions, 7805 flow
[2024-06-04 18:07:33,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:33,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:33,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:33,922 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 18:07:33,922 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:33,922 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:33,923 INFO  L85        PathProgramCache]: Analyzing trace with hash -1162515711, now seen corresponding path program 1 times
[2024-06-04 18:07:33,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:33,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90394707]
[2024-06-04 18:07:33,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:33,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:33,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:42,289 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-04 18:07:42,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:42,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90394707]
[2024-06-04 18:07:42,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90394707] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:42,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:42,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:07:42,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709896789]
[2024-06-04 18:07:42,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:42,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:07:42,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:42,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:07:42,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:07:42,448 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:07:42,448 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 470 transitions, 7805 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:42,449 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:42,449 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:07:42,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:44,461 INFO  L124   PetriNetUnfolderBase]: 3760/5676 cut-off events.
[2024-06-04 18:07:44,461 INFO  L125   PetriNetUnfolderBase]: For 554925/554933 co-relation queries the response was YES.
[2024-06-04 18:07:44,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52834 conditions, 5676 events. 3760/5676 cut-off events. For 554925/554933 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 30337 event pairs, 683 based on Foata normal form. 10/5684 useless extension candidates. Maximal degree in co-relation 52679. Up to 5367 conditions per place. 
[2024-06-04 18:07:44,542 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 425 selfloop transitions, 82 changer transitions 0/510 dead transitions.
[2024-06-04 18:07:44,542 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 510 transitions, 9241 flow
[2024-06-04 18:07:44,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:44,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:44,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-04 18:07:44,543 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-04 18:07:44,543 INFO  L175             Difference]: Start difference. First operand has 314 places, 470 transitions, 7805 flow. Second operand 8 states and 133 transitions.
[2024-06-04 18:07:44,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 510 transitions, 9241 flow
[2024-06-04 18:07:45,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 510 transitions, 9018 flow, removed 94 selfloop flow, removed 3 redundant places.
[2024-06-04 18:07:45,672 INFO  L231             Difference]: Finished difference. Result has 321 places, 484 transitions, 8008 flow
[2024-06-04 18:07:45,673 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7582, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8008, PETRI_PLACES=321, PETRI_TRANSITIONS=484}
[2024-06-04 18:07:45,673 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places.
[2024-06-04 18:07:45,673 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 484 transitions, 8008 flow
[2024-06-04 18:07:45,673 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:45,673 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:45,673 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:45,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-04 18:07:45,673 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:45,674 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:45,674 INFO  L85        PathProgramCache]: Analyzing trace with hash -1156801791, now seen corresponding path program 2 times
[2024-06-04 18:07:45,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:45,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352837478]
[2024-06-04 18:07:45,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:45,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:45,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:53,963 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-04 18:07:53,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:53,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352837478]
[2024-06-04 18:07:53,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352837478] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:53,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:53,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:07:53,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460272855]
[2024-06-04 18:07:53,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:53,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:07:53,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:53,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:07:53,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:07:54,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:07:54,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 484 transitions, 8008 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:54,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:54,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:07:54,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:56,250 INFO  L124   PetriNetUnfolderBase]: 3770/5692 cut-off events.
[2024-06-04 18:07:56,251 INFO  L125   PetriNetUnfolderBase]: For 573365/573373 co-relation queries the response was YES.
[2024-06-04 18:07:56,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53939 conditions, 5692 events. 3770/5692 cut-off events. For 573365/573373 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30501 event pairs, 696 based on Foata normal form. 10/5700 useless extension candidates. Maximal degree in co-relation 53780. Up to 5490 conditions per place. 
[2024-06-04 18:07:56,321 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 439 selfloop transitions, 67 changer transitions 0/509 dead transitions.
[2024-06-04 18:07:56,321 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 509 transitions, 9178 flow
[2024-06-04 18:07:56,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:56,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:56,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-04 18:07:56,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-04 18:07:56,322 INFO  L175             Difference]: Start difference. First operand has 321 places, 484 transitions, 8008 flow. Second operand 8 states and 127 transitions.
[2024-06-04 18:07:56,322 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 509 transitions, 9178 flow
[2024-06-04 18:07:57,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 509 transitions, 9053 flow, removed 58 selfloop flow, removed 2 redundant places.
[2024-06-04 18:07:57,293 INFO  L231             Difference]: Finished difference. Result has 327 places, 488 transitions, 8111 flow
[2024-06-04 18:07:57,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7909, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8111, PETRI_PLACES=327, PETRI_TRANSITIONS=488}
[2024-06-04 18:07:57,294 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places.
[2024-06-04 18:07:57,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 488 transitions, 8111 flow
[2024-06-04 18:07:57,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:57,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:57,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:57,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-04 18:07:57,294 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:57,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:57,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 864570977, now seen corresponding path program 1 times
[2024-06-04 18:07:57,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:57,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760893544]
[2024-06-04 18:07:57,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:57,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:57,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:08,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:08,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:08,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760893544]
[2024-06-04 18:08:08,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760893544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:08,310 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:08,310 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:08:08,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684325909]
[2024-06-04 18:08:08,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:08,310 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:08:08,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:08,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:08:08,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:08:08,522 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:08:08,523 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 488 transitions, 8111 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-04 18:08:08,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:08,523 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:08:08,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:10,618 INFO  L124   PetriNetUnfolderBase]: 3778/5707 cut-off events.
[2024-06-04 18:08:10,618 INFO  L125   PetriNetUnfolderBase]: For 587829/587837 co-relation queries the response was YES.
[2024-06-04 18:08:10,681 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54274 conditions, 5707 events. 3778/5707 cut-off events. For 587829/587837 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30604 event pairs, 576 based on Foata normal form. 10/5715 useless extension candidates. Maximal degree in co-relation 54113. Up to 5410 conditions per place. 
[2024-06-04 18:08:10,709 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 453 selfloop transitions, 62 changer transitions 0/518 dead transitions.
[2024-06-04 18:08:10,709 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 518 transitions, 9461 flow
[2024-06-04 18:08:10,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:10,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:10,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-04 18:08:10,710 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-04 18:08:10,710 INFO  L175             Difference]: Start difference. First operand has 327 places, 488 transitions, 8111 flow. Second operand 8 states and 131 transitions.
[2024-06-04 18:08:10,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 518 transitions, 9461 flow
[2024-06-04 18:08:11,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 518 transitions, 9305 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 18:08:11,784 INFO  L231             Difference]: Finished difference. Result has 330 places, 492 transitions, 8177 flow
[2024-06-04 18:08:11,784 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7955, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8177, PETRI_PLACES=330, PETRI_TRANSITIONS=492}
[2024-06-04 18:08:11,784 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 288 predicate places.
[2024-06-04 18:08:11,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 492 transitions, 8177 flow
[2024-06-04 18:08:11,785 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-04 18:08:11,785 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:11,785 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:11,785 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-04 18:08:11,785 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:11,785 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:11,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 864809987, now seen corresponding path program 2 times
[2024-06-04 18:08:11,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:11,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873303286]
[2024-06-04 18:08:11,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:11,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:11,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:23,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:23,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:23,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873303286]
[2024-06-04 18:08:23,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873303286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:23,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:23,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:23,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821221040]
[2024-06-04 18:08:23,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:23,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:23,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:23,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:23,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:23,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:08:23,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 492 transitions, 8177 flow. Second operand  has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 18:08:23,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:23,639 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:08:23,639 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:25,833 INFO  L124   PetriNetUnfolderBase]: 3786/5719 cut-off events.
[2024-06-04 18:08:25,834 INFO  L125   PetriNetUnfolderBase]: For 603824/603832 co-relation queries the response was YES.
[2024-06-04 18:08:25,892 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54660 conditions, 5719 events. 3786/5719 cut-off events. For 603824/603832 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30791 event pairs, 704 based on Foata normal form. 10/5727 useless extension candidates. Maximal degree in co-relation 54498. Up to 5514 conditions per place. 
[2024-06-04 18:08:25,920 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 444 selfloop transitions, 68 changer transitions 0/515 dead transitions.
[2024-06-04 18:08:25,920 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 515 transitions, 9321 flow
[2024-06-04 18:08:25,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:25,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:25,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-04 18:08:25,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-04 18:08:25,922 INFO  L175             Difference]: Start difference. First operand has 330 places, 492 transitions, 8177 flow. Second operand 8 states and 127 transitions.
[2024-06-04 18:08:25,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 515 transitions, 9321 flow
[2024-06-04 18:08:26,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 515 transitions, 9171 flow, removed 44 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:26,839 INFO  L231             Difference]: Finished difference. Result has 334 places, 494 transitions, 8220 flow
[2024-06-04 18:08:26,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8051, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8220, PETRI_PLACES=334, PETRI_TRANSITIONS=494}
[2024-06-04 18:08:26,840 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places.
[2024-06-04 18:08:26,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 334 places, 494 transitions, 8220 flow
[2024-06-04 18:08:26,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 18:08:26,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:26,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:26,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-04 18:08:26,840 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:26,840 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:26,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -210946559, now seen corresponding path program 3 times
[2024-06-04 18:08:26,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:26,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645611140]
[2024-06-04 18:08:26,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:26,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:26,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:35,260 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-04 18:08:35,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:35,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645611140]
[2024-06-04 18:08:35,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645611140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:35,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:35,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:08:35,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858463746]
[2024-06-04 18:08:35,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:35,261 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:08:35,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:35,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:08:35,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:08:35,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:08:35,405 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 494 transitions, 8220 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:35,405 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:35,405 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:08:35,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:37,554 INFO  L124   PetriNetUnfolderBase]: 3820/5762 cut-off events.
[2024-06-04 18:08:37,554 INFO  L125   PetriNetUnfolderBase]: For 628293/628293 co-relation queries the response was YES.
[2024-06-04 18:08:37,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55582 conditions, 5762 events. 3820/5762 cut-off events. For 628293/628293 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30906 event pairs, 694 based on Foata normal form. 2/5762 useless extension candidates. Maximal degree in co-relation 55418. Up to 5274 conditions per place. 
[2024-06-04 18:08:37,637 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 411 selfloop transitions, 115 changer transitions 0/529 dead transitions.
[2024-06-04 18:08:37,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 529 transitions, 9886 flow
[2024-06-04 18:08:37,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:37,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:37,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-04 18:08:37,638 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-04 18:08:37,638 INFO  L175             Difference]: Start difference. First operand has 334 places, 494 transitions, 8220 flow. Second operand 8 states and 134 transitions.
[2024-06-04 18:08:37,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 529 transitions, 9886 flow
[2024-06-04 18:08:38,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 529 transitions, 9737 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-04 18:08:38,884 INFO  L231             Difference]: Finished difference. Result has 336 places, 503 transitions, 8537 flow
[2024-06-04 18:08:38,885 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8537, PETRI_PLACES=336, PETRI_TRANSITIONS=503}
[2024-06-04 18:08:38,885 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 294 predicate places.
[2024-06-04 18:08:38,885 INFO  L495      AbstractCegarLoop]: Abstraction has has 336 places, 503 transitions, 8537 flow
[2024-06-04 18:08:38,885 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:38,885 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:38,885 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:38,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-04 18:08:38,885 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:38,886 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:38,886 INFO  L85        PathProgramCache]: Analyzing trace with hash 983020799, now seen corresponding path program 1 times
[2024-06-04 18:08:38,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:38,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358433920]
[2024-06-04 18:08:38,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:38,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:38,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:47,172 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-04 18:08:47,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:47,172 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358433920]
[2024-06-04 18:08:47,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358433920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:47,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:47,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:08:47,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455809696]
[2024-06-04 18:08:47,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:47,173 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:08:47,173 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:47,173 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:08:47,173 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:08:47,446 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:08:47,446 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 503 transitions, 8537 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:47,446 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:47,446 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:08:47,446 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:49,706 INFO  L124   PetriNetUnfolderBase]: 3825/5768 cut-off events.
[2024-06-04 18:08:49,706 INFO  L125   PetriNetUnfolderBase]: For 643854/643862 co-relation queries the response was YES.
[2024-06-04 18:08:49,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56380 conditions, 5768 events. 3825/5768 cut-off events. For 643854/643862 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30969 event pairs, 731 based on Foata normal form. 9/5775 useless extension candidates. Maximal degree in co-relation 56215. Up to 5667 conditions per place. 
[2024-06-04 18:08:49,780 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 481 selfloop transitions, 40 changer transitions 0/524 dead transitions.
[2024-06-04 18:08:49,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 524 transitions, 9718 flow
[2024-06-04 18:08:49,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:49,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:49,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-04 18:08:49,781 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3719512195121951
[2024-06-04 18:08:49,782 INFO  L175             Difference]: Start difference. First operand has 336 places, 503 transitions, 8537 flow. Second operand 8 states and 122 transitions.
[2024-06-04 18:08:49,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 524 transitions, 9718 flow
[2024-06-04 18:08:50,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 524 transitions, 9536 flow, removed 64 selfloop flow, removed 3 redundant places.
[2024-06-04 18:08:50,861 INFO  L231             Difference]: Finished difference. Result has 341 places, 506 transitions, 8522 flow
[2024-06-04 18:08:50,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8355, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8522, PETRI_PLACES=341, PETRI_TRANSITIONS=506}
[2024-06-04 18:08:50,861 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 299 predicate places.
[2024-06-04 18:08:50,861 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 506 transitions, 8522 flow
[2024-06-04 18:08:50,861 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:50,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:50,862 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:50,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-04 18:08:50,862 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:50,862 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:50,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -2127888347, now seen corresponding path program 1 times
[2024-06-04 18:08:50,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:50,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271187439]
[2024-06-04 18:08:50,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:50,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:50,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:58,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:58,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:58,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271187439]
[2024-06-04 18:08:58,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271187439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:58,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:58,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:08:58,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373355023]
[2024-06-04 18:08:58,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:58,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:08:58,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:58,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:08:58,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:08:58,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:08:58,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 506 transitions, 8522 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:58,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:58,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:08:58,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:01,080 INFO  L124   PetriNetUnfolderBase]: 3867/5826 cut-off events.
[2024-06-04 18:09:01,080 INFO  L125   PetriNetUnfolderBase]: For 671124/671132 co-relation queries the response was YES.
[2024-06-04 18:09:01,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57263 conditions, 5826 events. 3867/5826 cut-off events. For 671124/671132 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31317 event pairs, 733 based on Foata normal form. 10/5834 useless extension candidates. Maximal degree in co-relation 57096. Up to 5656 conditions per place. 
[2024-06-04 18:09:01,171 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 463 selfloop transitions, 73 changer transitions 0/539 dead transitions.
[2024-06-04 18:09:01,171 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 539 transitions, 10202 flow
[2024-06-04 18:09:01,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:09:01,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:09:01,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions.
[2024-06-04 18:09:01,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39634146341463417
[2024-06-04 18:09:01,173 INFO  L175             Difference]: Start difference. First operand has 341 places, 506 transitions, 8522 flow. Second operand 8 states and 130 transitions.
[2024-06-04 18:09:01,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 539 transitions, 10202 flow
[2024-06-04 18:09:02,584 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 539 transitions, 10076 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-04 18:09:02,591 INFO  L231             Difference]: Finished difference. Result has 344 places, 518 transitions, 8978 flow
[2024-06-04 18:09:02,591 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8396, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8978, PETRI_PLACES=344, PETRI_TRANSITIONS=518}
[2024-06-04 18:09:02,591 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 302 predicate places.
[2024-06-04 18:09:02,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 344 places, 518 transitions, 8978 flow
[2024-06-04 18:09:02,592 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:02,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:02,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:02,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-04 18:09:02,592 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:02,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:02,592 INFO  L85        PathProgramCache]: Analyzing trace with hash -1046926011, now seen corresponding path program 4 times
[2024-06-04 18:09:02,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:02,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482815101]
[2024-06-04 18:09:02,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:02,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:02,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:10,530 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-04 18:09:10,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:10,531 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482815101]
[2024-06-04 18:09:10,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482815101] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:10,531 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:10,531 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:10,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970578433]
[2024-06-04 18:09:10,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:10,531 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:10,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:10,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:10,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:10,767 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:09:10,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 518 transitions, 8978 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:10,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:10,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:09:10,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15