./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.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/safe011_power.opt_pso.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe011_power.opt_pso.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-cde23df-m
[2024-06-14 15:55:55,690 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:55:55,765 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:55:55,769 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:55:55,769 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:55:55,806 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:55:55,808 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:55:55,808 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:55:55,809 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:55:55,814 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:55:55,814 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:55:55,815 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:55:55,816 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:55:55,816 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:55:55,816 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:55:55,817 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:55:55,817 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:55:55,817 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:55:55,817 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:55:55,817 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:55:55,818 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:55:55,818 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:55:55,819 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:55:55,819 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:55:55,820 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:55:55,820 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:55:55,820 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:55:55,820 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:55:55,821 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:55:55,822 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:55:55,823 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:55:55,823 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:55:55,823 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:55:55,824 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:55:55,824 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:55:55,824 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:55:55,825 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:55:55,825 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:55:55,825 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:55:55,825 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:55:55,825 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:55:55,826 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:55:55,826 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:55:55,826 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 15:55:56,079 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:55:56,106 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:55:56,109 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:55:56,110 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:55:56,111 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:55:56,112 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/safe011_power.opt_pso.opt.yml/witness.yml
[2024-06-14 15:55:56,311 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:55:56,316 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:55:56,318 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i
[2024-06-14 15:55:57,504 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:55:57,703 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:55:57,704 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i
[2024-06-14 15:55:57,716 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42667baa/b7408510e44c482db65826bfba698dce/FLAG2180209c6
[2024-06-14 15:55:57,728 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42667baa/b7408510e44c482db65826bfba698dce
[2024-06-14 15:55:57,728 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:55:57,729 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:55:57,733 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:55:57,734 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:55:57,737 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:55:57,738 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:55:56" (1/2) ...
[2024-06-14 15:55:57,738 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cef8389 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:55:57, skipping insertion in model container
[2024-06-14 15:55:57,739 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:55:56" (1/2) ...
[2024-06-14 15:55:57,740 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@22b1b8c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:55:57, skipping insertion in model container
[2024-06-14 15:55:57,741 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:55:57" (2/2) ...
[2024-06-14 15:55:57,741 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cef8389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:57, skipping insertion in model container
[2024-06-14 15:55:57,741 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:55:57" (2/2) ...
[2024-06-14 15:55:57,742 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:55:57,829 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:55:57,830 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 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 )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_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 2) && z <= 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) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-14 15:55:57,831 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 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 )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_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 2) && z <= 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) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-14 15:55:57,831 INFO  L97    edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 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 )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_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 2) && z <= 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) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-14 15:55:57,832 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:55:57,832 INFO  L106   edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1;
[2024-06-14 15:55:57,877 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:55:58,330 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:55:58,343 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:55:58,690 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:55:58,755 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:55:58,755 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58 WrapperNode
[2024-06-14 15:55:58,755 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:55:58,757 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:55:58,757 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:55:58,758 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:55:58,764 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:58,800 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:58,936 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-14 15:55:58,936 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:55:58,937 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:55:58,937 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:55:58,938 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:55:58,948 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:58,948 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:58,982 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,023 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 15:55:59,024 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,025 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,059 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,062 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,075 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,082 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,103 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:55:59,105 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:55:59,105 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:55:59,105 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:55:59,106 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (1/1) ...
[2024-06-14 15:55:59,111 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:55:59,120 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:55:59,134 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 15:55:59,145 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 15:55:59,175 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:55:59,175 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:55:59,175 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:55:59,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:55:59,176 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:55:59,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:55:59,176 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:55:59,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:55:59,177 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:55:59,177 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:55:59,177 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:55:59,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:55:59,179 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 15:55:59,319 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:55:59,321 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:56:00,791 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:56:00,793 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:56:01,179 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:56:01,180 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:56:01,180 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:56:01 BoogieIcfgContainer
[2024-06-14 15:56:01,180 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:56:01,182 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:56:01,183 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:56:01,186 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:56:01,186 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:55:56" (1/4) ...
[2024-06-14 15:56:01,187 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20804d0f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:56:01, skipping insertion in model container
[2024-06-14 15:56:01,187 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:55:57" (2/4) ...
[2024-06-14 15:56:01,187 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20804d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:56:01, skipping insertion in model container
[2024-06-14 15:56:01,187 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:55:58" (3/4) ...
[2024-06-14 15:56:01,187 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20804d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:56:01, skipping insertion in model container
[2024-06-14 15:56:01,188 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:56:01" (4/4) ...
[2024-06-14 15:56:01,189 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i
[2024-06-14 15:56:01,206 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:56:01,206 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:56:01,207 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:56:01,321 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:56:01,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:56:01,404 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-14 15:56:01,404 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:56:01,406 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-14 15:56:01,406 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:56:01,409 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-14 15:56:01,417 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:56:01,423 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;@206a4468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:56:01,424 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:56:01,449 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:56:01,450 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:56:01,450 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:56:01,450 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:01,451 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:01,451 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:01,456 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:01,456 INFO  L85        PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times
[2024-06-14 15:56:01,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:01,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248875212]
[2024-06-14 15:56:01,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:01,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:01,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:07,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:07,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:07,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248875212]
[2024-06-14 15:56:07,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248875212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:07,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:07,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:56:07,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315713641]
[2024-06-14 15:56:07,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:07,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:56:07,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:07,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:56:07,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:56:07,898 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:07,900 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:07,900 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:07,900 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:07,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:09,099 INFO  L124   PetriNetUnfolderBase]: 1407/2119 cut-off events.
[2024-06-14 15:56:09,099 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-14 15:56:09,105 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4325 conditions, 2119 events. 1407/2119 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9669 event pairs, 989 based on Foata normal form. 1/2076 useless extension candidates. Maximal degree in co-relation 4310. Up to 2105 conditions per place. 
[2024-06-14 15:56:09,117 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-14 15:56:09,117 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 175 flow
[2024-06-14 15:56:09,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:56:09,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:56:09,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions.
[2024-06-14 15:56:09,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5528455284552846
[2024-06-14 15:56:09,130 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 68 transitions.
[2024-06-14 15:56:09,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 175 flow
[2024-06-14 15:56:09,133 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:56:09,135 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-14 15:56:09,136 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-14 15:56:09,140 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-14 15:56:09,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-14 15:56:09,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:09,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:09,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:09,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:56:09,141 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:09,142 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:09,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 588573823, now seen corresponding path program 1 times
[2024-06-14 15:56:09,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:09,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060707965]
[2024-06-14 15:56:09,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:09,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:09,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:13,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:13,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:13,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060707965]
[2024-06-14 15:56:13,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060707965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:13,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:13,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 15:56:13,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099071633]
[2024-06-14 15:56:13,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:13,388 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 15:56:13,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:13,389 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 15:56:13,390 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 15:56:13,489 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:13,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:13,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:13,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:13,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:14,584 INFO  L124   PetriNetUnfolderBase]: 1415/2130 cut-off events.
[2024-06-14 15:56:14,585 INFO  L125   PetriNetUnfolderBase]: For 400/408 co-relation queries the response was YES.
[2024-06-14 15:56:14,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4915 conditions, 2130 events. 1415/2130 cut-off events. For 400/408 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9623 event pairs, 866 based on Foata normal form. 8/2135 useless extension candidates. Maximal degree in co-relation 4900. Up to 2072 conditions per place. 
[2024-06-14 15:56:14,599 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions.
[2024-06-14 15:56:14,599 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 280 flow
[2024-06-14 15:56:14,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:56:14,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:56:14,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions.
[2024-06-14 15:56:14,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5670731707317073
[2024-06-14 15:56:14,607 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 93 transitions.
[2024-06-14 15:56:14,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 280 flow
[2024-06-14 15:56:14,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:56:14,612 INFO  L231             Difference]: Finished difference. Result has 46 places, 43 transitions, 172 flow
[2024-06-14 15:56:14,612 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=43}
[2024-06-14 15:56:14,613 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-14 15:56:14,613 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 172 flow
[2024-06-14 15:56:14,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:14,614 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:14,614 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:14,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:56:14,617 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:14,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:14,619 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times
[2024-06-14 15:56:14,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:14,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172925254]
[2024-06-14 15:56:14,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:14,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:14,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:18,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:18,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:18,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172925254]
[2024-06-14 15:56:18,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172925254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:18,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:18,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:56:18,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727722852]
[2024-06-14 15:56:18,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:18,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:56:18,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:18,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:56:18,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:56:18,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:18,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 172 flow. Second operand  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:18,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:18,381 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:18,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:19,462 INFO  L124   PetriNetUnfolderBase]: 1431/2152 cut-off events.
[2024-06-14 15:56:19,462 INFO  L125   PetriNetUnfolderBase]: For 1373/1390 co-relation queries the response was YES.
[2024-06-14 15:56:19,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5809 conditions, 2152 events. 1431/2152 cut-off events. For 1373/1390 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9782 event pairs, 618 based on Foata normal form. 16/2165 useless extension candidates. Maximal degree in co-relation 5791. Up to 2012 conditions per place. 
[2024-06-14 15:56:19,478 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 17 changer transitions 0/77 dead transitions.
[2024-06-14 15:56:19,478 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 418 flow
[2024-06-14 15:56:19,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:56:19,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:56:19,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions.
[2024-06-14 15:56:19,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5707317073170731
[2024-06-14 15:56:19,485 INFO  L175             Difference]: Start difference. First operand has 46 places, 43 transitions, 172 flow. Second operand 5 states and 117 transitions.
[2024-06-14 15:56:19,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 418 flow
[2024-06-14 15:56:19,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 414 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-14 15:56:19,490 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 251 flow
[2024-06-14 15:56:19,491 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-06-14 15:56:19,492 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-06-14 15:56:19,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 251 flow
[2024-06-14 15:56:19,492 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:19,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:19,493 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:19,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:56:19,493 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:19,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:19,495 INFO  L85        PathProgramCache]: Analyzing trace with hash 2146976690, now seen corresponding path program 1 times
[2024-06-14 15:56:19,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:19,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770046855]
[2024-06-14 15:56:19,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:19,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:19,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:24,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:24,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:24,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770046855]
[2024-06-14 15:56:24,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770046855] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:24,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:24,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:56:24,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491425782]
[2024-06-14 15:56:24,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:24,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:56:24,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:24,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:56:24,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:56:24,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:24,108 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 251 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:24,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:24,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:24,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:25,382 INFO  L124   PetriNetUnfolderBase]: 1482/2233 cut-off events.
[2024-06-14 15:56:25,383 INFO  L125   PetriNetUnfolderBase]: For 2719/2734 co-relation queries the response was YES.
[2024-06-14 15:56:25,387 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 2233 events. 1482/2233 cut-off events. For 2719/2734 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10266 event pairs, 484 based on Foata normal form. 24/2254 useless extension candidates. Maximal degree in co-relation 6778. Up to 1991 conditions per place. 
[2024-06-14 15:56:25,396 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 65 selfloop transitions, 19 changer transitions 0/88 dead transitions.
[2024-06-14 15:56:25,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 527 flow
[2024-06-14 15:56:25,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:25,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:25,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-06-14 15:56:25,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.556910569105691
[2024-06-14 15:56:25,402 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 251 flow. Second operand 6 states and 137 transitions.
[2024-06-14 15:56:25,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 527 flow
[2024-06-14 15:56:25,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 511 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-06-14 15:56:25,408 INFO  L231             Difference]: Finished difference. Result has 55 places, 51 transitions, 293 flow
[2024-06-14 15:56:25,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=55, PETRI_TRANSITIONS=51}
[2024-06-14 15:56:25,410 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places.
[2024-06-14 15:56:25,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 293 flow
[2024-06-14 15:56:25,411 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:25,411 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:25,411 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:25,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:56:25,411 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-14 15:56:25,412 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:25,412 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906018500, now seen corresponding path program 1 times
[2024-06-14 15:56:25,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:25,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318768596]
[2024-06-14 15:56:25,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:25,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:25,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:32,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-14 15:56:32,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:32,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318768596]
[2024-06-14 15:56:32,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318768596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:32,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:32,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:56:32,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086467308]
[2024-06-14 15:56:32,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:32,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:56:32,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:32,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:56:32,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:56:32,368 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:56:32,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 293 flow. Second operand  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:32,369 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:32,369 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:56:32,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:33,359 INFO  L124   PetriNetUnfolderBase]: 1477/2226 cut-off events.
[2024-06-14 15:56:33,360 INFO  L125   PetriNetUnfolderBase]: For 3973/3988 co-relation queries the response was YES.
[2024-06-14 15:56:33,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7279 conditions, 2226 events. 1477/2226 cut-off events. For 3973/3988 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10087 event pairs, 700 based on Foata normal form. 8/2231 useless extension candidates. Maximal degree in co-relation 7255. Up to 2203 conditions per place. 
[2024-06-14 15:56:33,375 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 53 selfloop transitions, 8 changer transitions 0/65 dead transitions.
[2024-06-14 15:56:33,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 461 flow
[2024-06-14 15:56:33,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:56:33,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:56:33,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions.
[2024-06-14 15:56:33,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4195121951219512
[2024-06-14 15:56:33,377 INFO  L175             Difference]: Start difference. First operand has 55 places, 51 transitions, 293 flow. Second operand 5 states and 86 transitions.
[2024-06-14 15:56:33,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 461 flow
[2024-06-14 15:56:33,381 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 419 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-14 15:56:33,382 INFO  L231             Difference]: Finished difference. Result has 56 places, 54 transitions, 299 flow
[2024-06-14 15:56:33,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=56, PETRI_TRANSITIONS=54}
[2024-06-14 15:56:33,383 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places.
[2024-06-14 15:56:33,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 299 flow
[2024-06-14 15:56:33,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:33,384 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:33,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:33,384 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:56:33,384 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:33,385 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:33,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081397346, now seen corresponding path program 1 times
[2024-06-14 15:56:33,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:33,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330287035]
[2024-06-14 15:56:33,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:33,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:33,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:39,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:39,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:39,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330287035]
[2024-06-14 15:56:39,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330287035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:39,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:39,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:56:39,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816001710]
[2024-06-14 15:56:39,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:39,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:56:39,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:39,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:56:39,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:56:40,084 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:40,084 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 299 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-14 15:56:40,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:40,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:40,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:41,103 INFO  L124   PetriNetUnfolderBase]: 1704/2551 cut-off events.
[2024-06-14 15:56:41,103 INFO  L125   PetriNetUnfolderBase]: For 5473/5473 co-relation queries the response was YES.
[2024-06-14 15:56:41,111 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 2551 events. 1704/2551 cut-off events. For 5473/5473 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11697 event pairs, 828 based on Foata normal form. 2/2551 useless extension candidates. Maximal degree in co-relation 8488. Up to 2520 conditions per place. 
[2024-06-14 15:56:41,123 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 64 selfloop transitions, 11 changer transitions 0/78 dead transitions.
[2024-06-14 15:56:41,123 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 540 flow
[2024-06-14 15:56:41,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:41,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:41,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 15:56:41,124 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:56:41,124 INFO  L175             Difference]: Start difference. First operand has 56 places, 54 transitions, 299 flow. Second operand 6 states and 96 transitions.
[2024-06-14 15:56:41,124 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 540 flow
[2024-06-14 15:56:41,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 507 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-14 15:56:41,129 INFO  L231             Difference]: Finished difference. Result has 61 places, 63 transitions, 371 flow
[2024-06-14 15:56:41,130 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=61, PETRI_TRANSITIONS=63}
[2024-06-14 15:56:41,130 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places.
[2024-06-14 15:56:41,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 371 flow
[2024-06-14 15:56:41,131 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-14 15:56:41,131 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:41,131 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:41,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:56:41,131 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:41,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:41,132 INFO  L85        PathProgramCache]: Analyzing trace with hash 830700505, now seen corresponding path program 1 times
[2024-06-14 15:56:41,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:41,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786417548]
[2024-06-14 15:56:41,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:41,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:41,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:47,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:47,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:47,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786417548]
[2024-06-14 15:56:47,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786417548] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:47,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:47,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:56:47,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773777657]
[2024-06-14 15:56:47,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:47,297 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:56:47,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:47,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:56:47,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:56:47,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:56:47,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 371 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:47,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:47,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:56:47,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:48,391 INFO  L124   PetriNetUnfolderBase]: 1650/2482 cut-off events.
[2024-06-14 15:56:48,391 INFO  L125   PetriNetUnfolderBase]: For 7654/7703 co-relation queries the response was YES.
[2024-06-14 15:56:48,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9085 conditions, 2482 events. 1650/2482 cut-off events. For 7654/7703 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11437 event pairs, 720 based on Foata normal form. 16/2487 useless extension candidates. Maximal degree in co-relation 9056. Up to 2412 conditions per place. 
[2024-06-14 15:56:48,407 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 18 changer transitions 0/94 dead transitions.
[2024-06-14 15:56:48,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 673 flow
[2024-06-14 15:56:48,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:48,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:48,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-14 15:56:48,409 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-14 15:56:48,409 INFO  L175             Difference]: Start difference. First operand has 61 places, 63 transitions, 371 flow. Second operand 6 states and 110 transitions.
[2024-06-14 15:56:48,409 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 673 flow
[2024-06-14 15:56:48,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 665 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-06-14 15:56:48,413 INFO  L231             Difference]: Finished difference. Result has 68 places, 74 transitions, 513 flow
[2024-06-14 15:56:48,414 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=68, PETRI_TRANSITIONS=74}
[2024-06-14 15:56:48,414 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places.
[2024-06-14 15:56:48,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 513 flow
[2024-06-14 15:56:48,414 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:48,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:48,415 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:48,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:56:48,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-14 15:56:48,415 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:48,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 836414425, now seen corresponding path program 2 times
[2024-06-14 15:56:48,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:48,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41117949]
[2024-06-14 15:56:48,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:48,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:48,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:54,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:54,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:54,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41117949]
[2024-06-14 15:56:54,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41117949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:54,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:54,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:56:54,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438937609]
[2024-06-14 15:56:54,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:54,576 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:56:54,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:54,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:56:54,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:56:54,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:56:54,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 513 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:54,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:54,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:56:54,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:55,587 INFO  L124   PetriNetUnfolderBase]: 1704/2561 cut-off events.
[2024-06-14 15:56:55,587 INFO  L125   PetriNetUnfolderBase]: For 10260/10332 co-relation queries the response was YES.
[2024-06-14 15:56:55,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10562 conditions, 2561 events. 1704/2561 cut-off events. For 10260/10332 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11807 event pairs, 722 based on Foata normal form. 17/2566 useless extension candidates. Maximal degree in co-relation 10528. Up to 2428 conditions per place. 
[2024-06-14 15:56:55,605 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 25 changer transitions 0/101 dead transitions.
[2024-06-14 15:56:55,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 847 flow
[2024-06-14 15:56:55,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:55,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:55,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-14 15:56:55,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-14 15:56:55,607 INFO  L175             Difference]: Start difference. First operand has 68 places, 74 transitions, 513 flow. Second operand 6 states and 110 transitions.
[2024-06-14 15:56:55,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 847 flow
[2024-06-14 15:56:55,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 815 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-14 15:56:55,620 INFO  L231             Difference]: Finished difference. Result has 73 places, 82 transitions, 632 flow
[2024-06-14 15:56:55,620 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=73, PETRI_TRANSITIONS=82}
[2024-06-14 15:56:55,623 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places.
[2024-06-14 15:56:55,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 632 flow
[2024-06-14 15:56:55,623 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:55,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:55,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:55,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:56:55,624 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:55,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:55,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 2027764451, now seen corresponding path program 1 times
[2024-06-14 15:56:55,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:55,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594785063]
[2024-06-14 15:56:55,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:55,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:55,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:02,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:02,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:02,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594785063]
[2024-06-14 15:57:02,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594785063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:02,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:02,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:02,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720753883]
[2024-06-14 15:57:02,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:02,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:02,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:02,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:02,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:02,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:02,717 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 632 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-14 15:57:02,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:02,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:02,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:03,730 INFO  L124   PetriNetUnfolderBase]: 1751/2618 cut-off events.
[2024-06-14 15:57:03,730 INFO  L125   PetriNetUnfolderBase]: For 12783/12783 co-relation queries the response was YES.
[2024-06-14 15:57:03,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11267 conditions, 2618 events. 1751/2618 cut-off events. For 12783/12783 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11942 event pairs, 792 based on Foata normal form. 2/2618 useless extension candidates. Maximal degree in co-relation 11230. Up to 2578 conditions per place. 
[2024-06-14 15:57:03,747 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 87 selfloop transitions, 14 changer transitions 0/104 dead transitions.
[2024-06-14 15:57:03,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 900 flow
[2024-06-14 15:57:03,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:03,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:03,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-14 15:57:03,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3832752613240418
[2024-06-14 15:57:03,749 INFO  L175             Difference]: Start difference. First operand has 73 places, 82 transitions, 632 flow. Second operand 7 states and 110 transitions.
[2024-06-14 15:57:03,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 900 flow
[2024-06-14 15:57:03,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 855 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-14 15:57:03,766 INFO  L231             Difference]: Finished difference. Result has 78 places, 85 transitions, 647 flow
[2024-06-14 15:57:03,766 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=647, PETRI_PLACES=78, PETRI_TRANSITIONS=85}
[2024-06-14 15:57:03,767 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places.
[2024-06-14 15:57:03,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 647 flow
[2024-06-14 15:57:03,768 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-14 15:57:03,768 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:03,768 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:03,768 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:57:03,768 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:03,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:03,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 739436373, now seen corresponding path program 1 times
[2024-06-14 15:57:03,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:03,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041911473]
[2024-06-14 15:57:03,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:03,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:03,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:09,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:09,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:09,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041911473]
[2024-06-14 15:57:09,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041911473] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:09,638 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:09,638 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:09,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118998199]
[2024-06-14 15:57:09,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:09,639 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:09,639 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:09,640 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:09,640 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:09,800 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:57:09,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 647 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:09,801 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:09,801 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:57:09,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:10,856 INFO  L124   PetriNetUnfolderBase]: 1731/2602 cut-off events.
[2024-06-14 15:57:10,857 INFO  L125   PetriNetUnfolderBase]: For 17152/17192 co-relation queries the response was YES.
[2024-06-14 15:57:10,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11970 conditions, 2602 events. 1731/2602 cut-off events. For 17152/17192 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12212 event pairs, 572 based on Foata normal form. 27/2580 useless extension candidates. Maximal degree in co-relation 11931. Up to 2368 conditions per place. 
[2024-06-14 15:57:10,872 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 85 selfloop transitions, 33 changer transitions 0/126 dead transitions.
[2024-06-14 15:57:10,872 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 1054 flow
[2024-06-14 15:57:10,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:10,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:10,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 15:57:10,874 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47735191637630664
[2024-06-14 15:57:10,874 INFO  L175             Difference]: Start difference. First operand has 78 places, 85 transitions, 647 flow. Second operand 7 states and 137 transitions.
[2024-06-14 15:57:10,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 1054 flow
[2024-06-14 15:57:10,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 1018 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-14 15:57:10,887 INFO  L231             Difference]: Finished difference. Result has 81 places, 94 transitions, 768 flow
[2024-06-14 15:57:10,887 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=81, PETRI_TRANSITIONS=94}
[2024-06-14 15:57:10,888 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places.
[2024-06-14 15:57:10,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 768 flow
[2024-06-14 15:57:10,888 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:10,888 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:10,888 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:10,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:57:10,889 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:10,889 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:10,889 INFO  L85        PathProgramCache]: Analyzing trace with hash 739556529, now seen corresponding path program 1 times
[2024-06-14 15:57:10,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:10,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887723]
[2024-06-14 15:57:10,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:10,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:10,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:17,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:17,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:17,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887723]
[2024-06-14 15:57:17,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:17,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:17,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:17,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540320388]
[2024-06-14 15:57:17,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:17,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:17,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:17,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:17,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:17,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:17,503 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 768 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-14 15:57:17,503 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:17,503 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:17,503 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:18,490 INFO  L124   PetriNetUnfolderBase]: 1829/2730 cut-off events.
[2024-06-14 15:57:18,491 INFO  L125   PetriNetUnfolderBase]: For 18300/18300 co-relation queries the response was YES.
[2024-06-14 15:57:18,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13346 conditions, 2730 events. 1829/2730 cut-off events. For 18300/18300 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12482 event pairs, 626 based on Foata normal form. 2/2730 useless extension candidates. Maximal degree in co-relation 13305. Up to 2684 conditions per place. 
[2024-06-14 15:57:18,508 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 108 selfloop transitions, 14 changer transitions 0/125 dead transitions.
[2024-06-14 15:57:18,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 1139 flow
[2024-06-14 15:57:18,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:18,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:18,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-14 15:57:18,511 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-14 15:57:18,511 INFO  L175             Difference]: Start difference. First operand has 81 places, 94 transitions, 768 flow. Second operand 7 states and 113 transitions.
[2024-06-14 15:57:18,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 1139 flow
[2024-06-14 15:57:18,526 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 125 transitions, 1066 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-14 15:57:18,528 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 824 flow
[2024-06-14 15:57:18,528 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=824, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2024-06-14 15:57:18,529 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places.
[2024-06-14 15:57:18,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 824 flow
[2024-06-14 15:57:18,529 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-14 15:57:18,530 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:18,530 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:18,530 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:57:18,530 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:18,530 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:18,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -1570485063, now seen corresponding path program 2 times
[2024-06-14 15:57:18,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:18,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534814877]
[2024-06-14 15:57:18,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:18,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:18,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:24,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:24,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:24,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534814877]
[2024-06-14 15:57:24,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534814877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:24,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:24,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:24,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593861145]
[2024-06-14 15:57:24,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:24,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:24,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:24,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:24,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:24,969 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:57:24,969 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 824 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:24,969 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:24,969 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:57:24,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:26,118 INFO  L124   PetriNetUnfolderBase]: 1844/2768 cut-off events.
[2024-06-14 15:57:26,118 INFO  L125   PetriNetUnfolderBase]: For 24760/24818 co-relation queries the response was YES.
[2024-06-14 15:57:26,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14282 conditions, 2768 events. 1844/2768 cut-off events. For 24760/24818 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13039 event pairs, 551 based on Foata normal form. 34/2755 useless extension candidates. Maximal degree in co-relation 14238. Up to 2419 conditions per place. 
[2024-06-14 15:57:26,137 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 89 selfloop transitions, 45 changer transitions 0/145 dead transitions.
[2024-06-14 15:57:26,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 145 transitions, 1370 flow
[2024-06-14 15:57:26,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:26,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:26,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 15:57:26,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4808362369337979
[2024-06-14 15:57:26,138 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 824 flow. Second operand 7 states and 138 transitions.
[2024-06-14 15:57:26,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 145 transitions, 1370 flow
[2024-06-14 15:57:26,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 145 transitions, 1344 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-14 15:57:26,152 INFO  L231             Difference]: Finished difference. Result has 93 places, 112 transitions, 1031 flow
[2024-06-14 15:57:26,152 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1031, PETRI_PLACES=93, PETRI_TRANSITIONS=112}
[2024-06-14 15:57:26,153 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places.
[2024-06-14 15:57:26,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 112 transitions, 1031 flow
[2024-06-14 15:57:26,153 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:26,154 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:26,154 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:26,154 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:57:26,154 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:26,154 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:26,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -1564055787, now seen corresponding path program 2 times
[2024-06-14 15:57:26,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:26,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890888194]
[2024-06-14 15:57:26,155 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:26,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:26,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:32,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:32,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:32,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890888194]
[2024-06-14 15:57:32,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890888194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:32,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:32,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:32,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22521501]
[2024-06-14 15:57:32,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:32,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:32,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:32,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:32,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:32,642 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:32,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 112 transitions, 1031 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-14 15:57:32,642 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:32,642 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:32,642 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:33,658 INFO  L124   PetriNetUnfolderBase]: 1956/2912 cut-off events.
[2024-06-14 15:57:33,659 INFO  L125   PetriNetUnfolderBase]: For 27849/27863 co-relation queries the response was YES.
[2024-06-14 15:57:33,666 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15875 conditions, 2912 events. 1956/2912 cut-off events. For 27849/27863 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13377 event pairs, 642 based on Foata normal form. 12/2921 useless extension candidates. Maximal degree in co-relation 15828. Up to 2817 conditions per place. 
[2024-06-14 15:57:33,673 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 25 changer transitions 0/141 dead transitions.
[2024-06-14 15:57:33,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 141 transitions, 1469 flow
[2024-06-14 15:57:33,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:33,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:33,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-14 15:57:33,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-14 15:57:33,676 INFO  L175             Difference]: Start difference. First operand has 93 places, 112 transitions, 1031 flow. Second operand 7 states and 116 transitions.
[2024-06-14 15:57:33,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 141 transitions, 1469 flow
[2024-06-14 15:57:33,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 141 transitions, 1389 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-14 15:57:33,695 INFO  L231             Difference]: Finished difference. Result has 98 places, 120 transitions, 1088 flow
[2024-06-14 15:57:33,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1088, PETRI_PLACES=98, PETRI_TRANSITIONS=120}
[2024-06-14 15:57:33,696 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places.
[2024-06-14 15:57:33,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 120 transitions, 1088 flow
[2024-06-14 15:57:33,696 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-14 15:57:33,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:33,697 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:33,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:57:33,697 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-14 15:57:33,697 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:33,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -1564055973, now seen corresponding path program 3 times
[2024-06-14 15:57:33,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:33,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21126288]
[2024-06-14 15:57:33,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:33,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:33,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:39,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:39,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:39,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21126288]
[2024-06-14 15:57:39,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21126288] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:39,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:39,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:39,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906691236]
[2024-06-14 15:57:39,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:39,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:39,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:39,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:39,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:39,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:57:39,828 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 120 transitions, 1088 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:39,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:39,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:57:39,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:40,971 INFO  L124   PetriNetUnfolderBase]: 1900/2853 cut-off events.
[2024-06-14 15:57:40,971 INFO  L125   PetriNetUnfolderBase]: For 33744/33806 co-relation queries the response was YES.
[2024-06-14 15:57:40,979 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16305 conditions, 2853 events. 1900/2853 cut-off events. For 33744/33806 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13467 event pairs, 580 based on Foata normal form. 30/2829 useless extension candidates. Maximal degree in co-relation 16255. Up to 2301 conditions per place. 
[2024-06-14 15:57:40,988 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 94 selfloop transitions, 55 changer transitions 0/162 dead transitions.
[2024-06-14 15:57:40,988 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 162 transitions, 1746 flow
[2024-06-14 15:57:40,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:40,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:40,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-14 15:57:40,990 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47038327526132406
[2024-06-14 15:57:40,991 INFO  L175             Difference]: Start difference. First operand has 98 places, 120 transitions, 1088 flow. Second operand 7 states and 135 transitions.
[2024-06-14 15:57:40,991 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 162 transitions, 1746 flow
[2024-06-14 15:57:41,018 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 162 transitions, 1676 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 15:57:41,021 INFO  L231             Difference]: Finished difference. Result has 102 places, 131 transitions, 1341 flow
[2024-06-14 15:57:41,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1341, PETRI_PLACES=102, PETRI_TRANSITIONS=131}
[2024-06-14 15:57:41,022 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-14 15:57:41,022 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 131 transitions, 1341 flow
[2024-06-14 15:57:41,022 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:41,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:41,023 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:41,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:57:41,023 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:41,023 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:41,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -1563818637, now seen corresponding path program 3 times
[2024-06-14 15:57:41,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:41,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461818939]
[2024-06-14 15:57:41,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:41,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:41,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:47,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:47,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:47,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461818939]
[2024-06-14 15:57:47,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461818939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:47,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:47,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:47,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59353125]
[2024-06-14 15:57:47,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:47,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:47,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:47,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:47,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:47,269 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:47,269 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 131 transitions, 1341 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-14 15:57:47,269 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:47,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:47,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:48,311 INFO  L124   PetriNetUnfolderBase]: 1971/2934 cut-off events.
[2024-06-14 15:57:48,311 INFO  L125   PetriNetUnfolderBase]: For 36155/36169 co-relation queries the response was YES.
[2024-06-14 15:57:48,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17564 conditions, 2934 events. 1971/2934 cut-off events. For 36155/36169 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13566 event pairs, 644 based on Foata normal form. 12/2943 useless extension candidates. Maximal degree in co-relation 17512. Up to 2841 conditions per place. 
[2024-06-14 15:57:48,331 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 121 selfloop transitions, 27 changer transitions 0/151 dead transitions.
[2024-06-14 15:57:48,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 151 transitions, 1692 flow
[2024-06-14 15:57:48,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:48,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:48,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-14 15:57:48,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-14 15:57:48,334 INFO  L175             Difference]: Start difference. First operand has 102 places, 131 transitions, 1341 flow. Second operand 7 states and 113 transitions.
[2024-06-14 15:57:48,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 151 transitions, 1692 flow
[2024-06-14 15:57:48,360 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 151 transitions, 1594 flow, removed 39 selfloop flow, removed 2 redundant places.
[2024-06-14 15:57:48,363 INFO  L231             Difference]: Finished difference. Result has 107 places, 132 transitions, 1312 flow
[2024-06-14 15:57:48,364 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1312, PETRI_PLACES=107, PETRI_TRANSITIONS=132}
[2024-06-14 15:57:48,364 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places.
[2024-06-14 15:57:48,364 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 1312 flow
[2024-06-14 15:57:48,365 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-14 15:57:48,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:48,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:48,365 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:57:48,365 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:48,366 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:48,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 159291165, now seen corresponding path program 1 times
[2024-06-14 15:57:48,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:48,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101649151]
[2024-06-14 15:57:48,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:48,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:48,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:55,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:55,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:55,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101649151]
[2024-06-14 15:57:55,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101649151] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:55,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:55,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:57:55,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110939420]
[2024-06-14 15:57:55,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:55,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:57:55,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:55,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:57:55,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:57:55,707 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:55,708 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 132 transitions, 1312 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-14 15:57:55,708 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:55,708 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:55,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:56,794 INFO  L124   PetriNetUnfolderBase]: 1963/2920 cut-off events.
[2024-06-14 15:57:56,794 INFO  L125   PetriNetUnfolderBase]: For 36647/36647 co-relation queries the response was YES.
[2024-06-14 15:57:56,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17401 conditions, 2920 events. 1963/2920 cut-off events. For 36647/36647 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13429 event pairs, 618 based on Foata normal form. 4/2922 useless extension candidates. Maximal degree in co-relation 17347. Up to 2862 conditions per place. 
[2024-06-14 15:57:56,812 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 139 selfloop transitions, 16 changer transitions 0/158 dead transitions.
[2024-06-14 15:57:56,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 158 transitions, 1702 flow
[2024-06-14 15:57:56,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:57:56,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:57:56,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-14 15:57:56,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 15:57:56,815 INFO  L175             Difference]: Start difference. First operand has 107 places, 132 transitions, 1312 flow. Second operand 8 states and 124 transitions.
[2024-06-14 15:57:56,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 158 transitions, 1702 flow
[2024-06-14 15:57:56,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 158 transitions, 1660 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-06-14 15:57:56,840 INFO  L231             Difference]: Finished difference. Result has 111 places, 134 transitions, 1333 flow
[2024-06-14 15:57:56,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1333, PETRI_PLACES=111, PETRI_TRANSITIONS=134}
[2024-06-14 15:57:56,840 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places.
[2024-06-14 15:57:56,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 134 transitions, 1333 flow
[2024-06-14 15:57:56,841 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-14 15:57:56,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:56,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:56,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:57:56,841 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:56,842 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:56,842 INFO  L85        PathProgramCache]: Analyzing trace with hash -564406446, now seen corresponding path program 1 times
[2024-06-14 15:57:56,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:56,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343507614]
[2024-06-14 15:57:56,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:56,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:56,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:02,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:02,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:02,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343507614]
[2024-06-14 15:58:02,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343507614] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:02,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:02,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:02,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973866241]
[2024-06-14 15:58:02,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:02,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:02,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:02,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:02,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:03,099 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:58:03,100 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 134 transitions, 1333 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:03,100 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:03,100 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:58:03,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:04,238 INFO  L124   PetriNetUnfolderBase]: 1880/2817 cut-off events.
[2024-06-14 15:58:04,239 INFO  L125   PetriNetUnfolderBase]: For 41361/41425 co-relation queries the response was YES.
[2024-06-14 15:58:04,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17330 conditions, 2817 events. 1880/2817 cut-off events. For 41361/41425 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13180 event pairs, 565 based on Foata normal form. 35/2824 useless extension candidates. Maximal degree in co-relation 17275. Up to 2541 conditions per place. 
[2024-06-14 15:58:04,258 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 115 selfloop transitions, 42 changer transitions 0/172 dead transitions.
[2024-06-14 15:58:04,259 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 172 transitions, 1851 flow
[2024-06-14 15:58:04,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:58:04,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:58:04,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 15:58:04,260 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4808362369337979
[2024-06-14 15:58:04,260 INFO  L175             Difference]: Start difference. First operand has 111 places, 134 transitions, 1333 flow. Second operand 7 states and 138 transitions.
[2024-06-14 15:58:04,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 172 transitions, 1851 flow
[2024-06-14 15:58:04,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 172 transitions, 1806 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-14 15:58:04,290 INFO  L231             Difference]: Finished difference. Result has 113 places, 141 transitions, 1484 flow
[2024-06-14 15:58:04,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1484, PETRI_PLACES=113, PETRI_TRANSITIONS=141}
[2024-06-14 15:58:04,291 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places.
[2024-06-14 15:58:04,291 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 141 transitions, 1484 flow
[2024-06-14 15:58:04,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:04,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:04,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:04,292 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:58:04,292 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:04,292 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:04,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447692771, now seen corresponding path program 1 times
[2024-06-14 15:58:04,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:04,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840320589]
[2024-06-14 15:58:04,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:04,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:04,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:09,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-14 15:58:09,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:09,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840320589]
[2024-06-14 15:58:09,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840320589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:09,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:09,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:09,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821451225]
[2024-06-14 15:58:09,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:09,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:09,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:09,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:09,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:09,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:09,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 141 transitions, 1484 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-14 15:58:09,581 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:09,581 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:09,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:10,801 INFO  L124   PetriNetUnfolderBase]: 1990/2960 cut-off events.
[2024-06-14 15:58:10,801 INFO  L125   PetriNetUnfolderBase]: For 44940/44940 co-relation queries the response was YES.
[2024-06-14 15:58:10,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18545 conditions, 2960 events. 1990/2960 cut-off events. For 44940/44940 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13505 event pairs, 597 based on Foata normal form. 4/2962 useless extension candidates. Maximal degree in co-relation 18488. Up to 2861 conditions per place. 
[2024-06-14 15:58:10,819 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 161 selfloop transitions, 20 changer transitions 0/184 dead transitions.
[2024-06-14 15:58:10,819 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 184 transitions, 2053 flow
[2024-06-14 15:58:10,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:10,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:10,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-14 15:58:10,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-14 15:58:10,822 INFO  L175             Difference]: Start difference. First operand has 113 places, 141 transitions, 1484 flow. Second operand 8 states and 133 transitions.
[2024-06-14 15:58:10,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 184 transitions, 2053 flow
[2024-06-14 15:58:10,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 184 transitions, 1977 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 15:58:10,855 INFO  L231             Difference]: Finished difference. Result has 121 places, 153 transitions, 1615 flow
[2024-06-14 15:58:10,855 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1615, PETRI_PLACES=121, PETRI_TRANSITIONS=153}
[2024-06-14 15:58:10,856 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places.
[2024-06-14 15:58:10,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 153 transitions, 1615 flow
[2024-06-14 15:58:10,856 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-14 15:58:10,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:10,857 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:10,857 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:58:10,857 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:10,857 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:10,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -560677704, now seen corresponding path program 1 times
[2024-06-14 15:58:10,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:10,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087225958]
[2024-06-14 15:58:10,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:10,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:10,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:17,809 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:17,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:17,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087225958]
[2024-06-14 15:58:17,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087225958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:17,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:17,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:17,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395655104]
[2024-06-14 15:58:17,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:17,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:17,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:17,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:17,812 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:17,995 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:17,995 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 153 transitions, 1615 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-14 15:58:17,995 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:17,995 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:17,995 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:19,162 INFO  L124   PetriNetUnfolderBase]: 2061/3064 cut-off events.
[2024-06-14 15:58:19,162 INFO  L125   PetriNetUnfolderBase]: For 50660/50660 co-relation queries the response was YES.
[2024-06-14 15:58:19,174 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19592 conditions, 3064 events. 2061/3064 cut-off events. For 50660/50660 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14116 event pairs, 524 based on Foata normal form. 6/3068 useless extension candidates. Maximal degree in co-relation 19531. Up to 2833 conditions per place. 
[2024-06-14 15:58:19,185 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 159 selfloop transitions, 34 changer transitions 0/196 dead transitions.
[2024-06-14 15:58:19,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 196 transitions, 2279 flow
[2024-06-14 15:58:19,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:19,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:19,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-14 15:58:19,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4176829268292683
[2024-06-14 15:58:19,187 INFO  L175             Difference]: Start difference. First operand has 121 places, 153 transitions, 1615 flow. Second operand 8 states and 137 transitions.
[2024-06-14 15:58:19,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 196 transitions, 2279 flow
[2024-06-14 15:58:19,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 196 transitions, 2237 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-14 15:58:19,235 INFO  L231             Difference]: Finished difference. Result has 129 places, 165 transitions, 1819 flow
[2024-06-14 15:58:19,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1819, PETRI_PLACES=129, PETRI_TRANSITIONS=165}
[2024-06-14 15:58:19,236 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places.
[2024-06-14 15:58:19,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 165 transitions, 1819 flow
[2024-06-14 15:58:19,236 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-14 15:58:19,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:19,236 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:19,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:58:19,237 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:19,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:19,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -560677921, now seen corresponding path program 2 times
[2024-06-14 15:58:19,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:19,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905936791]
[2024-06-14 15:58:19,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:19,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:19,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:25,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:25,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:25,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905936791]
[2024-06-14 15:58:25,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905936791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:25,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:25,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:25,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381062539]
[2024-06-14 15:58:25,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:25,466 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:25,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:25,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:25,467 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:25,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:25,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 165 transitions, 1819 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-14 15:58:25,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:25,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:25,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:26,761 INFO  L124   PetriNetUnfolderBase]: 2105/3128 cut-off events.
[2024-06-14 15:58:26,762 INFO  L125   PetriNetUnfolderBase]: For 57509/57509 co-relation queries the response was YES.
[2024-06-14 15:58:26,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20967 conditions, 3128 events. 2105/3128 cut-off events. For 57509/57509 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14426 event pairs, 533 based on Foata normal form. 8/3134 useless extension candidates. Maximal degree in co-relation 20902. Up to 2856 conditions per place. 
[2024-06-14 15:58:26,782 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 161 selfloop transitions, 38 changer transitions 0/202 dead transitions.
[2024-06-14 15:58:26,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 202 transitions, 2449 flow
[2024-06-14 15:58:26,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:26,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:26,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-14 15:58:26,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42073170731707316
[2024-06-14 15:58:26,785 INFO  L175             Difference]: Start difference. First operand has 129 places, 165 transitions, 1819 flow. Second operand 8 states and 138 transitions.
[2024-06-14 15:58:26,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 202 transitions, 2449 flow
[2024-06-14 15:58:26,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 202 transitions, 2381 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-14 15:58:26,836 INFO  L231             Difference]: Finished difference. Result has 134 places, 171 transitions, 1921 flow
[2024-06-14 15:58:26,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1921, PETRI_PLACES=134, PETRI_TRANSITIONS=171}
[2024-06-14 15:58:26,836 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places.
[2024-06-14 15:58:26,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 171 transitions, 1921 flow
[2024-06-14 15:58:26,837 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-14 15:58:26,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:26,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:26,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:58:26,837 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-14 15:58:26,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:26,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 1451411841, now seen corresponding path program 3 times
[2024-06-14 15:58:26,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:26,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523819847]
[2024-06-14 15:58:26,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:26,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:26,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:32,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:32,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:32,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523819847]
[2024-06-14 15:58:32,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523819847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:32,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:32,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:32,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728408600]
[2024-06-14 15:58:32,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:32,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:32,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:32,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:32,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:32,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:32,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 171 transitions, 1921 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-14 15:58:32,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:32,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:32,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:33,649 INFO  L124   PetriNetUnfolderBase]: 2108/3132 cut-off events.
[2024-06-14 15:58:33,649 INFO  L125   PetriNetUnfolderBase]: For 61243/61243 co-relation queries the response was YES.
[2024-06-14 15:58:33,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21510 conditions, 3132 events. 2108/3132 cut-off events. For 61243/61243 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14412 event pairs, 552 based on Foata normal form. 4/3134 useless extension candidates. Maximal degree in co-relation 21443. Up to 2859 conditions per place. 
[2024-06-14 15:58:33,677 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 163 selfloop transitions, 40 changer transitions 0/206 dead transitions.
[2024-06-14 15:58:33,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 206 transitions, 2542 flow
[2024-06-14 15:58:33,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:33,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:33,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 15:58:33,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-14 15:58:33,682 INFO  L175             Difference]: Start difference. First operand has 134 places, 171 transitions, 1921 flow. Second operand 8 states and 139 transitions.
[2024-06-14 15:58:33,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 206 transitions, 2542 flow
[2024-06-14 15:58:33,750 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 206 transitions, 2445 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 15:58:33,753 INFO  L231             Difference]: Finished difference. Result has 137 places, 175 transitions, 1967 flow
[2024-06-14 15:58:33,753 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1967, PETRI_PLACES=137, PETRI_TRANSITIONS=175}
[2024-06-14 15:58:33,754 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places.
[2024-06-14 15:58:33,754 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 175 transitions, 1967 flow
[2024-06-14 15:58:33,754 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-14 15:58:33,754 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:33,754 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:33,754 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:58:33,754 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:33,755 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:33,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241087639, now seen corresponding path program 4 times
[2024-06-14 15:58:33,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:33,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214030824]
[2024-06-14 15:58:33,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:33,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:33,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:40,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:40,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:40,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214030824]
[2024-06-14 15:58:40,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214030824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:40,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:40,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:40,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115198104]
[2024-06-14 15:58:40,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:40,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:40,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:40,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:40,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:40,468 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:40,468 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 175 transitions, 1967 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-14 15:58:40,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:40,469 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:40,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:41,720 INFO  L124   PetriNetUnfolderBase]: 2238/3325 cut-off events.
[2024-06-14 15:58:41,720 INFO  L125   PetriNetUnfolderBase]: For 71420/71443 co-relation queries the response was YES.
[2024-06-14 15:58:41,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22903 conditions, 3325 events. 2238/3325 cut-off events. For 71420/71443 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15471 event pairs, 557 based on Foata normal form. 16/3338 useless extension candidates. Maximal degree in co-relation 22835. Up to 2773 conditions per place. 
[2024-06-14 15:58:41,746 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 163 selfloop transitions, 58 changer transitions 0/224 dead transitions.
[2024-06-14 15:58:41,746 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 224 transitions, 2937 flow
[2024-06-14 15:58:41,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:41,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:41,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 15:58:41,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4481707317073171
[2024-06-14 15:58:41,748 INFO  L175             Difference]: Start difference. First operand has 137 places, 175 transitions, 1967 flow. Second operand 8 states and 147 transitions.
[2024-06-14 15:58:41,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 224 transitions, 2937 flow
[2024-06-14 15:58:41,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 224 transitions, 2868 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 15:58:41,806 INFO  L231             Difference]: Finished difference. Result has 143 places, 188 transitions, 2206 flow
[2024-06-14 15:58:41,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2206, PETRI_PLACES=143, PETRI_TRANSITIONS=188}
[2024-06-14 15:58:41,806 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places.
[2024-06-14 15:58:41,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 188 transitions, 2206 flow
[2024-06-14 15:58:41,807 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-14 15:58:41,807 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:41,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:41,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:58:41,807 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:41,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:41,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241087422, now seen corresponding path program 2 times
[2024-06-14 15:58:41,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:41,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213587520]
[2024-06-14 15:58:41,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:41,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:41,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:48,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:48,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:48,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213587520]
[2024-06-14 15:58:48,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213587520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:48,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:48,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:48,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475963529]
[2024-06-14 15:58:48,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:48,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:48,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:48,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:48,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:49,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:49,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 188 transitions, 2206 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-14 15:58:49,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:49,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:49,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:50,308 INFO  L124   PetriNetUnfolderBase]: 2227/3306 cut-off events.
[2024-06-14 15:58:50,308 INFO  L125   PetriNetUnfolderBase]: For 77001/77026 co-relation queries the response was YES.
[2024-06-14 15:58:50,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23790 conditions, 3306 events. 2227/3306 cut-off events. For 77001/77026 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15361 event pairs, 589 based on Foata normal form. 20/3323 useless extension candidates. Maximal degree in co-relation 23719. Up to 3204 conditions per place. 
[2024-06-14 15:58:50,333 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 181 selfloop transitions, 29 changer transitions 0/213 dead transitions.
[2024-06-14 15:58:50,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 213 transitions, 2710 flow
[2024-06-14 15:58:50,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:50,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:50,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 15:58:50,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:58:50,336 INFO  L175             Difference]: Start difference. First operand has 143 places, 188 transitions, 2206 flow. Second operand 8 states and 128 transitions.
[2024-06-14 15:58:50,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 213 transitions, 2710 flow
[2024-06-14 15:58:50,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 213 transitions, 2593 flow, removed 36 selfloop flow, removed 3 redundant places.
[2024-06-14 15:58:50,407 INFO  L231             Difference]: Finished difference. Result has 148 places, 190 transitions, 2185 flow
[2024-06-14 15:58:50,408 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2091, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2185, PETRI_PLACES=148, PETRI_TRANSITIONS=190}
[2024-06-14 15:58:50,408 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places.
[2024-06-14 15:58:50,408 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 2185 flow
[2024-06-14 15:58:50,409 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-14 15:58:50,409 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:50,409 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:50,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:58:50,409 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:50,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:50,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -1233735989, now seen corresponding path program 5 times
[2024-06-14 15:58:50,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:50,410 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959239029]
[2024-06-14 15:58:50,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:50,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:50,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:56,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:56,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:56,972 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959239029]
[2024-06-14 15:58:56,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959239029] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:56,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:56,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:56,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628005772]
[2024-06-14 15:58:56,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:56,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:56,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:56,973 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:56,973 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:57,105 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:57,105 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 2185 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-14 15:58:57,105 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:57,105 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:57,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:58,288 INFO  L124   PetriNetUnfolderBase]: 2245/3336 cut-off events.
[2024-06-14 15:58:58,288 INFO  L125   PetriNetUnfolderBase]: For 80566/80589 co-relation queries the response was YES.
[2024-06-14 15:58:58,304 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23736 conditions, 3336 events. 2245/3336 cut-off events. For 80566/80589 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15549 event pairs, 540 based on Foata normal form. 16/3349 useless extension candidates. Maximal degree in co-relation 23663. Up to 2785 conditions per place. 
[2024-06-14 15:58:58,318 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 157 selfloop transitions, 68 changer transitions 0/228 dead transitions.
[2024-06-14 15:58:58,318 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 228 transitions, 2999 flow
[2024-06-14 15:58:58,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:58,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:58,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 15:58:58,321 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-14 15:58:58,321 INFO  L175             Difference]: Start difference. First operand has 148 places, 190 transitions, 2185 flow. Second operand 8 states and 143 transitions.
[2024-06-14 15:58:58,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 228 transitions, 2999 flow
[2024-06-14 15:58:58,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 228 transitions, 2923 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 15:58:58,471 INFO  L231             Difference]: Finished difference. Result has 151 places, 196 transitions, 2352 flow
[2024-06-14 15:58:58,471 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2352, PETRI_PLACES=151, PETRI_TRANSITIONS=196}
[2024-06-14 15:58:58,471 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places.
[2024-06-14 15:58:58,472 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 196 transitions, 2352 flow
[2024-06-14 15:58:58,472 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-14 15:58:58,472 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:58,472 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:58,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:58:58,472 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:58,473 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:58,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 642783770, now seen corresponding path program 3 times
[2024-06-14 15:58:58,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:58,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641496539]
[2024-06-14 15:58:58,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:58,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:58,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:05,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-14 15:59:05,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:05,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641496539]
[2024-06-14 15:59:05,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641496539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:05,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:05,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:05,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644948422]
[2024-06-14 15:59:05,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:05,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:05,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:05,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:05,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:05,407 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:05,408 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 196 transitions, 2352 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-14 15:59:05,408 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:05,408 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:05,408 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:06,662 INFO  L124   PetriNetUnfolderBase]: 2256/3350 cut-off events.
[2024-06-14 15:59:06,663 INFO  L125   PetriNetUnfolderBase]: For 86229/86254 co-relation queries the response was YES.
[2024-06-14 15:59:06,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24666 conditions, 3350 events. 2256/3350 cut-off events. For 86229/86254 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15607 event pairs, 579 based on Foata normal form. 20/3367 useless extension candidates. Maximal degree in co-relation 24591. Up to 3248 conditions per place. 
[2024-06-14 15:59:06,693 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 189 selfloop transitions, 30 changer transitions 0/222 dead transitions.
[2024-06-14 15:59:06,693 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 222 transitions, 2902 flow
[2024-06-14 15:59:06,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:59:06,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:59:06,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-14 15:59:06,696 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-14 15:59:06,696 INFO  L175             Difference]: Start difference. First operand has 151 places, 196 transitions, 2352 flow. Second operand 8 states and 127 transitions.
[2024-06-14 15:59:06,696 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 222 transitions, 2902 flow
[2024-06-14 15:59:06,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 222 transitions, 2739 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:06,786 INFO  L231             Difference]: Finished difference. Result has 155 places, 199 transitions, 2317 flow
[2024-06-14 15:59:06,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2317, PETRI_PLACES=155, PETRI_TRANSITIONS=199}
[2024-06-14 15:59:06,787 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places.
[2024-06-14 15:59:06,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 199 transitions, 2317 flow
[2024-06-14 15:59:06,787 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-14 15:59:06,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:06,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:06,788 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:59:06,788 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:06,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:06,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 635426323, now seen corresponding path program 6 times
[2024-06-14 15:59:06,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:06,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992010364]
[2024-06-14 15:59:06,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:06,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:06,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:13,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:13,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:13,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992010364]
[2024-06-14 15:59:13,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992010364] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:13,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:13,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:13,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482659705]
[2024-06-14 15:59:13,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:13,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:13,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:13,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:13,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:13,376 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:13,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 199 transitions, 2317 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-14 15:59:13,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:13,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:13,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:14,568 INFO  L124   PetriNetUnfolderBase]: 2246/3338 cut-off events.
[2024-06-14 15:59:14,568 INFO  L125   PetriNetUnfolderBase]: For 89716/89739 co-relation queries the response was YES.
[2024-06-14 15:59:14,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24241 conditions, 3338 events. 2246/3338 cut-off events. For 89716/89739 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15514 event pairs, 544 based on Foata normal form. 12/3347 useless extension candidates. Maximal degree in co-relation 24165. Up to 2788 conditions per place. 
[2024-06-14 15:59:14,598 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 157 selfloop transitions, 73 changer transitions 0/233 dead transitions.
[2024-06-14 15:59:14,598 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 233 transitions, 3101 flow
[2024-06-14 15:59:14,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:59:14,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:59:14,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:59:14,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:59:14,601 INFO  L175             Difference]: Start difference. First operand has 155 places, 199 transitions, 2317 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:59:14,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 233 transitions, 3101 flow
[2024-06-14 15:59:14,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 3023 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 15:59:14,688 INFO  L231             Difference]: Finished difference. Result has 157 places, 202 transitions, 2437 flow
[2024-06-14 15:59:14,688 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2437, PETRI_PLACES=157, PETRI_TRANSITIONS=202}
[2024-06-14 15:59:14,689 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places.
[2024-06-14 15:59:14,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 202 transitions, 2437 flow
[2024-06-14 15:59:14,689 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-14 15:59:14,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:14,690 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:14,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:59:14,690 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:14,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:14,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 643050680, now seen corresponding path program 4 times
[2024-06-14 15:59:14,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:14,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078757687]
[2024-06-14 15:59:14,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:14,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:14,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:21,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:21,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:21,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078757687]
[2024-06-14 15:59:21,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078757687] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:21,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:21,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:21,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143869652]
[2024-06-14 15:59:21,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:21,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:21,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:21,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:21,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:21,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:21,902 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 202 transitions, 2437 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-14 15:59:21,902 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:21,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:21,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:23,121 INFO  L124   PetriNetUnfolderBase]: 2235/3319 cut-off events.
[2024-06-14 15:59:23,121 INFO  L125   PetriNetUnfolderBase]: For 95075/95100 co-relation queries the response was YES.
[2024-06-14 15:59:23,136 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24687 conditions, 3319 events. 2235/3319 cut-off events. For 95075/95100 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15430 event pairs, 565 based on Foata normal form. 20/3336 useless extension candidates. Maximal degree in co-relation 24610. Up to 3181 conditions per place. 
[2024-06-14 15:59:23,148 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 188 selfloop transitions, 42 changer transitions 0/233 dead transitions.
[2024-06-14 15:59:23,148 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 233 transitions, 3021 flow
[2024-06-14 15:59:23,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:23,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:23,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-14 15:59:23,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-14 15:59:23,150 INFO  L175             Difference]: Start difference. First operand has 157 places, 202 transitions, 2437 flow. Second operand 9 states and 142 transitions.
[2024-06-14 15:59:23,150 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 233 transitions, 3021 flow
[2024-06-14 15:59:23,231 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 233 transitions, 2883 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:23,233 INFO  L231             Difference]: Finished difference. Result has 163 places, 206 transitions, 2471 flow
[2024-06-14 15:59:23,234 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2471, PETRI_PLACES=163, PETRI_TRANSITIONS=206}
[2024-06-14 15:59:23,234 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places.
[2024-06-14 15:59:23,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 206 transitions, 2471 flow
[2024-06-14 15:59:23,234 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-14 15:59:23,234 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:23,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:23,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:59:23,235 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:23,235 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:23,235 INFO  L85        PathProgramCache]: Analyzing trace with hash -962710473, now seen corresponding path program 1 times
[2024-06-14 15:59:23,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:23,235 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975996471]
[2024-06-14 15:59:23,235 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:23,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:23,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:33,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:33,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:33,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975996471]
[2024-06-14 15:59:33,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975996471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:33,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:33,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:33,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744523421]
[2024-06-14 15:59:33,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:33,551 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:33,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:33,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:33,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:33,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:33,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 206 transitions, 2471 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:33,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:33,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:33,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:34,797 INFO  L124   PetriNetUnfolderBase]: 2171/3221 cut-off events.
[2024-06-14 15:59:34,797 INFO  L125   PetriNetUnfolderBase]: For 96682/96707 co-relation queries the response was YES.
[2024-06-14 15:59:34,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23999 conditions, 3221 events. 2171/3221 cut-off events. For 96682/96707 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14878 event pairs, 553 based on Foata normal form. 22/3240 useless extension candidates. Maximal degree in co-relation 23920. Up to 3163 conditions per place. 
[2024-06-14 15:59:34,825 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 191 selfloop transitions, 20 changer transitions 0/214 dead transitions.
[2024-06-14 15:59:34,825 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 214 transitions, 2913 flow
[2024-06-14 15:59:34,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:59:34,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:59:34,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions.
[2024-06-14 15:59:34,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4097560975609756
[2024-06-14 15:59:34,827 INFO  L175             Difference]: Start difference. First operand has 163 places, 206 transitions, 2471 flow. Second operand 5 states and 84 transitions.
[2024-06-14 15:59:34,827 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 214 transitions, 2913 flow
[2024-06-14 15:59:34,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 2819 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-14 15:59:34,919 INFO  L231             Difference]: Finished difference. Result has 162 places, 206 transitions, 2428 flow
[2024-06-14 15:59:34,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2428, PETRI_PLACES=162, PETRI_TRANSITIONS=206}
[2024-06-14 15:59:34,920 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-14 15:59:34,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 206 transitions, 2428 flow
[2024-06-14 15:59:34,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:34,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:34,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:34,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 15:59:34,921 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:34,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:34,921 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253583042, now seen corresponding path program 1 times
[2024-06-14 15:59:34,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:34,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869910135]
[2024-06-14 15:59:34,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:34,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:34,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:41,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:41,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:41,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869910135]
[2024-06-14 15:59:41,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869910135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:41,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:41,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:59:41,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321196250]
[2024-06-14 15:59:41,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:41,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:59:41,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:41,182 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:59:41,182 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:59:41,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:59:41,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 206 transitions, 2428 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:41,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:41,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:59:41,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:42,769 INFO  L124   PetriNetUnfolderBase]: 2223/3328 cut-off events.
[2024-06-14 15:59:42,770 INFO  L125   PetriNetUnfolderBase]: For 105377/105416 co-relation queries the response was YES.
[2024-06-14 15:59:42,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25112 conditions, 3328 events. 2223/3328 cut-off events. For 105377/105416 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15777 event pairs, 508 based on Foata normal form. 11/3284 useless extension candidates. Maximal degree in co-relation 25032. Up to 2957 conditions per place. 
[2024-06-14 15:59:42,803 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 179 selfloop transitions, 59 changer transitions 0/274 dead transitions.
[2024-06-14 15:59:42,803 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 274 transitions, 3523 flow
[2024-06-14 15:59:42,805 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:42,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:42,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-14 15:59:42,805 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-14 15:59:42,805 INFO  L175             Difference]: Start difference. First operand has 162 places, 206 transitions, 2428 flow. Second operand 9 states and 165 transitions.
[2024-06-14 15:59:42,805 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 274 transitions, 3523 flow
[2024-06-14 15:59:42,913 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 274 transitions, 3461 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:42,916 INFO  L231             Difference]: Finished difference. Result has 170 places, 233 transitions, 2975 flow
[2024-06-14 15:59:42,916 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2975, PETRI_PLACES=170, PETRI_TRANSITIONS=233}
[2024-06-14 15:59:42,917 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places.
[2024-06-14 15:59:42,917 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 233 transitions, 2975 flow
[2024-06-14 15:59:42,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:42,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:42,918 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:42,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 15:59:42,918 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:42,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:42,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 1925942740, now seen corresponding path program 2 times
[2024-06-14 15:59:42,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:42,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088642191]
[2024-06-14 15:59:42,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:42,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:42,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:49,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:49,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:49,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088642191]
[2024-06-14 15:59:49,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088642191] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:49,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:49,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:49,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181172311]
[2024-06-14 15:59:49,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:49,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:49,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:49,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:49,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:49,286 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:59:49,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 233 transitions, 2975 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-14 15:59:49,286 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:49,287 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:59:49,287 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:50,649 INFO  L124   PetriNetUnfolderBase]: 2304/3457 cut-off events.
[2024-06-14 15:59:50,650 INFO  L125   PetriNetUnfolderBase]: For 117807/117861 co-relation queries the response was YES.
[2024-06-14 15:59:50,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26546 conditions, 3457 events. 2304/3457 cut-off events. For 117807/117861 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16642 event pairs, 369 based on Foata normal form. 37/3437 useless extension candidates. Maximal degree in co-relation 26463. Up to 2902 conditions per place. 
[2024-06-14 15:59:50,681 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 180 selfloop transitions, 65 changer transitions 0/281 dead transitions.
[2024-06-14 15:59:50,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 281 transitions, 3785 flow
[2024-06-14 15:59:50,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:59:50,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:59:50,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions.
[2024-06-14 15:59:50,683 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5470383275261324
[2024-06-14 15:59:50,683 INFO  L175             Difference]: Start difference. First operand has 170 places, 233 transitions, 2975 flow. Second operand 7 states and 157 transitions.
[2024-06-14 15:59:50,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 281 transitions, 3785 flow
[2024-06-14 15:59:50,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 281 transitions, 3687 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-14 15:59:50,787 INFO  L231             Difference]: Finished difference. Result has 175 places, 238 transitions, 3107 flow
[2024-06-14 15:59:50,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3107, PETRI_PLACES=175, PETRI_TRANSITIONS=238}
[2024-06-14 15:59:50,788 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-14 15:59:50,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 238 transitions, 3107 flow
[2024-06-14 15:59:50,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-14 15:59:50,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:50,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:50,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 15:59:50,790 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:50,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:50,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -319410268, now seen corresponding path program 3 times
[2024-06-14 15:59:50,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:50,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687177238]
[2024-06-14 15:59:50,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:50,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:50,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:57,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:57,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:57,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687177238]
[2024-06-14 15:59:57,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687177238] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:57,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:57,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:59:57,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184169951]
[2024-06-14 15:59:57,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:57,113 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:59:57,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:57,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:59:57,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:59:57,250 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:59:57,250 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 238 transitions, 3107 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:57,250 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:57,250 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:59:57,251 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:58,821 INFO  L124   PetriNetUnfolderBase]: 2365/3554 cut-off events.
[2024-06-14 15:59:58,821 INFO  L125   PetriNetUnfolderBase]: For 128773/128836 co-relation queries the response was YES.
[2024-06-14 15:59:58,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27996 conditions, 3554 events. 2365/3554 cut-off events. For 128773/128836 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17241 event pairs, 501 based on Foata normal form. 28/3523 useless extension candidates. Maximal degree in co-relation 27912. Up to 3057 conditions per place. 
[2024-06-14 15:59:58,857 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 173 selfloop transitions, 72 changer transitions 0/281 dead transitions.
[2024-06-14 15:59:58,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 281 transitions, 3891 flow
[2024-06-14 15:59:58,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:59:58,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:59:58,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-14 15:59:58,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4817073170731707
[2024-06-14 15:59:58,858 INFO  L175             Difference]: Start difference. First operand has 175 places, 238 transitions, 3107 flow. Second operand 8 states and 158 transitions.
[2024-06-14 15:59:58,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 281 transitions, 3891 flow
[2024-06-14 15:59:58,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 281 transitions, 3741 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:58,989 INFO  L231             Difference]: Finished difference. Result has 179 places, 240 transitions, 3163 flow
[2024-06-14 15:59:58,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2963, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3163, PETRI_PLACES=179, PETRI_TRANSITIONS=240}
[2024-06-14 15:59:58,989 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places.
[2024-06-14 15:59:58,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 240 transitions, 3163 flow
[2024-06-14 15:59:58,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:58,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:58,990 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:58,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 15:59:58,990 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:58,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:58,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1926003314, now seen corresponding path program 1 times
[2024-06-14 15:59:58,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:58,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111664840]
[2024-06-14 15:59:58,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:58,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:59,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:05,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:05,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:05,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111664840]
[2024-06-14 16:00:05,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111664840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:05,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:05,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:05,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561782870]
[2024-06-14 16:00:05,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:05,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:05,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:05,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:05,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:05,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:05,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 240 transitions, 3163 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-14 16:00:05,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:05,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:05,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:07,265 INFO  L124   PetriNetUnfolderBase]: 2465/3677 cut-off events.
[2024-06-14 16:00:07,265 INFO  L125   PetriNetUnfolderBase]: For 114665/114669 co-relation queries the response was YES.
[2024-06-14 16:00:07,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28303 conditions, 3677 events. 2465/3677 cut-off events. For 114665/114669 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17628 event pairs, 562 based on Foata normal form. 6/3681 useless extension candidates. Maximal degree in co-relation 28217. Up to 3491 conditions per place. 
[2024-06-14 16:00:07,296 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 235 selfloop transitions, 33 changer transitions 0/271 dead transitions.
[2024-06-14 16:00:07,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 271 transitions, 3805 flow
[2024-06-14 16:00:07,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:07,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:07,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-14 16:00:07,299 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-14 16:00:07,299 INFO  L175             Difference]: Start difference. First operand has 179 places, 240 transitions, 3163 flow. Second operand 8 states and 133 transitions.
[2024-06-14 16:00:07,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 271 transitions, 3805 flow
[2024-06-14 16:00:07,435 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 271 transitions, 3641 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 16:00:07,439 INFO  L231             Difference]: Finished difference. Result has 181 places, 240 transitions, 3077 flow
[2024-06-14 16:00:07,439 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2999, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3077, PETRI_PLACES=181, PETRI_TRANSITIONS=240}
[2024-06-14 16:00:07,439 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places.
[2024-06-14 16:00:07,439 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 240 transitions, 3077 flow
[2024-06-14 16:00:07,440 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-14 16:00:07,440 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:07,440 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:07,440 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 16:00:07,440 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:07,440 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:07,440 INFO  L85        PathProgramCache]: Analyzing trace with hash -201137890, now seen corresponding path program 1 times
[2024-06-14 16:00:07,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:07,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892703235]
[2024-06-14 16:00:07,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:07,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:07,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:14,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:14,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:14,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892703235]
[2024-06-14 16:00:14,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892703235] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:14,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:14,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:14,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317197692]
[2024-06-14 16:00:14,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:14,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:14,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:14,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:14,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:14,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:14,429 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 240 transitions, 3077 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-14 16:00:14,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:14,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:14,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:15,990 INFO  L124   PetriNetUnfolderBase]: 2557/3831 cut-off events.
[2024-06-14 16:00:15,990 INFO  L125   PetriNetUnfolderBase]: For 130410/130412 co-relation queries the response was YES.
[2024-06-14 16:00:16,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28990 conditions, 3831 events. 2557/3831 cut-off events. For 130410/130412 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18732 event pairs, 570 based on Foata normal form. 26/3855 useless extension candidates. Maximal degree in co-relation 28903. Up to 3366 conditions per place. 
[2024-06-14 16:00:16,028 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 224 selfloop transitions, 52 changer transitions 0/279 dead transitions.
[2024-06-14 16:00:16,028 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 279 transitions, 3805 flow
[2024-06-14 16:00:16,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:00:16,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:00:16,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-14 16:00:16,031 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 16:00:16,031 INFO  L175             Difference]: Start difference. First operand has 181 places, 240 transitions, 3077 flow. Second operand 9 states and 153 transitions.
[2024-06-14 16:00:16,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 279 transitions, 3805 flow
[2024-06-14 16:00:16,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 279 transitions, 3711 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-14 16:00:16,203 INFO  L231             Difference]: Finished difference. Result has 184 places, 242 transitions, 3134 flow
[2024-06-14 16:00:16,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2983, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3134, PETRI_PLACES=184, PETRI_TRANSITIONS=242}
[2024-06-14 16:00:16,204 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places.
[2024-06-14 16:00:16,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 242 transitions, 3134 flow
[2024-06-14 16:00:16,204 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-14 16:00:16,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:16,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:16,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 16:00:16,205 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:16,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:16,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -201322588, now seen corresponding path program 4 times
[2024-06-14 16:00:16,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:16,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342027961]
[2024-06-14 16:00:16,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:16,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:16,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:23,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:23,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:23,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342027961]
[2024-06-14 16:00:23,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342027961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:23,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:23,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:23,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837025923]
[2024-06-14 16:00:23,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:23,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:23,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:23,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:23,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:23,730 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 16:00:23,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 242 transitions, 3134 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:23,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:23,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 16:00:23,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:25,247 INFO  L124   PetriNetUnfolderBase]: 2514/3805 cut-off events.
[2024-06-14 16:00:25,248 INFO  L125   PetriNetUnfolderBase]: For 144482/144550 co-relation queries the response was YES.
[2024-06-14 16:00:25,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29655 conditions, 3805 events. 2514/3805 cut-off events. For 144482/144550 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18955 event pairs, 528 based on Foata normal form. 27/3762 useless extension candidates. Maximal degree in co-relation 29567. Up to 3209 conditions per place. 
[2024-06-14 16:00:25,288 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 166 selfloop transitions, 81 changer transitions 0/284 dead transitions.
[2024-06-14 16:00:25,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 284 transitions, 3990 flow
[2024-06-14 16:00:25,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:25,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:25,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-14 16:00:25,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47865853658536583
[2024-06-14 16:00:25,289 INFO  L175             Difference]: Start difference. First operand has 184 places, 242 transitions, 3134 flow. Second operand 8 states and 157 transitions.
[2024-06-14 16:00:25,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 284 transitions, 3990 flow
[2024-06-14 16:00:25,448 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 284 transitions, 3869 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-14 16:00:25,452 INFO  L231             Difference]: Finished difference. Result has 185 places, 244 transitions, 3232 flow
[2024-06-14 16:00:25,452 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3013, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3232, PETRI_PLACES=185, PETRI_TRANSITIONS=244}
[2024-06-14 16:00:25,452 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places.
[2024-06-14 16:00:25,452 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 244 transitions, 3232 flow
[2024-06-14 16:00:25,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:25,452 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:25,453 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:25,453 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 16:00:25,453 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:25,453 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:25,453 INFO  L85        PathProgramCache]: Analyzing trace with hash 180990574, now seen corresponding path program 1 times
[2024-06-14 16:00:25,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:25,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108238875]
[2024-06-14 16:00:25,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:25,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:25,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:32,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:32,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:32,518 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108238875]
[2024-06-14 16:00:32,518 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108238875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:32,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:32,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:32,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604954447]
[2024-06-14 16:00:32,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:32,519 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:32,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:32,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:32,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:32,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:32,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 244 transitions, 3232 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-14 16:00:32,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:32,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:32,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:34,087 INFO  L124   PetriNetUnfolderBase]: 2661/3996 cut-off events.
[2024-06-14 16:00:34,087 INFO  L125   PetriNetUnfolderBase]: For 139942/139967 co-relation queries the response was YES.
[2024-06-14 16:00:34,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30885 conditions, 3996 events. 2661/3996 cut-off events. For 139942/139967 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19727 event pairs, 577 based on Foata normal form. 14/4005 useless extension candidates. Maximal degree in co-relation 30796. Up to 3368 conditions per place. 
[2024-06-14 16:00:34,129 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 198 selfloop transitions, 82 changer transitions 0/283 dead transitions.
[2024-06-14 16:00:34,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 283 transitions, 4206 flow
[2024-06-14 16:00:34,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:00:34,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:00:34,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:00:34,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43360433604336046
[2024-06-14 16:00:34,131 INFO  L175             Difference]: Start difference. First operand has 185 places, 244 transitions, 3232 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:00:34,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 283 transitions, 4206 flow
[2024-06-14 16:00:34,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 283 transitions, 4025 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-14 16:00:34,292 INFO  L231             Difference]: Finished difference. Result has 188 places, 247 transitions, 3265 flow
[2024-06-14 16:00:34,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3051, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3265, PETRI_PLACES=188, PETRI_TRANSITIONS=247}
[2024-06-14 16:00:34,293 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places.
[2024-06-14 16:00:34,293 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 247 transitions, 3265 flow
[2024-06-14 16:00:34,293 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-14 16:00:34,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:34,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:34,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 16:00:34,293 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:34,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:34,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 180997332, now seen corresponding path program 2 times
[2024-06-14 16:00:34,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:34,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206828756]
[2024-06-14 16:00:34,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:34,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:34,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:41,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:41,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:41,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206828756]
[2024-06-14 16:00:41,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206828756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:41,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:41,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:41,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128136152]
[2024-06-14 16:00:41,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:41,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:41,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:41,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:41,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:42,000 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:42,000 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 247 transitions, 3265 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-14 16:00:42,000 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:42,000 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:42,001 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:43,476 INFO  L124   PetriNetUnfolderBase]: 2678/4020 cut-off events.
[2024-06-14 16:00:43,476 INFO  L125   PetriNetUnfolderBase]: For 145246/145275 co-relation queries the response was YES.
[2024-06-14 16:00:43,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31170 conditions, 4020 events. 2678/4020 cut-off events. For 145246/145275 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 19900 event pairs, 622 based on Foata normal form. 26/4042 useless extension candidates. Maximal degree in co-relation 31080. Up to 3884 conditions per place. 
[2024-06-14 16:00:43,518 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 243 selfloop transitions, 33 changer transitions 0/279 dead transitions.
[2024-06-14 16:00:43,519 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 279 transitions, 3951 flow
[2024-06-14 16:00:43,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:00:43,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:00:43,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-14 16:00:43,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-14 16:00:43,521 INFO  L175             Difference]: Start difference. First operand has 188 places, 247 transitions, 3265 flow. Second operand 9 states and 142 transitions.
[2024-06-14 16:00:43,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 279 transitions, 3951 flow
[2024-06-14 16:00:43,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 279 transitions, 3763 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-14 16:00:43,790 INFO  L231             Difference]: Finished difference. Result has 190 places, 249 transitions, 3192 flow
[2024-06-14 16:00:43,790 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3077, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3192, PETRI_PLACES=190, PETRI_TRANSITIONS=249}
[2024-06-14 16:00:43,790 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places.
[2024-06-14 16:00:43,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 249 transitions, 3192 flow
[2024-06-14 16:00:43,791 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-14 16:00:43,791 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:43,791 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:43,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 16:00:43,791 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:43,792 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:43,792 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776623708, now seen corresponding path program 5 times
[2024-06-14 16:00:43,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:43,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623990223]
[2024-06-14 16:00:43,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:43,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:43,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:50,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:50,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:50,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623990223]
[2024-06-14 16:00:50,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623990223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:50,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:50,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:50,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712555653]
[2024-06-14 16:00:50,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:50,728 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:50,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:50,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:50,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:50,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 16:00:50,887 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 249 transitions, 3192 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:50,887 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:50,887 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 16:00:50,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:52,491 INFO  L124   PetriNetUnfolderBase]: 2607/3953 cut-off events.
[2024-06-14 16:00:52,491 INFO  L125   PetriNetUnfolderBase]: For 167765/167856 co-relation queries the response was YES.
[2024-06-14 16:00:52,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30982 conditions, 3953 events. 2607/3953 cut-off events. For 167765/167856 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19876 event pairs, 533 based on Foata normal form. 33/3908 useless extension candidates. Maximal degree in co-relation 30891. Up to 3171 conditions per place. 
[2024-06-14 16:00:52,532 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 164 selfloop transitions, 88 changer transitions 0/291 dead transitions.
[2024-06-14 16:00:52,532 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 291 transitions, 4170 flow
[2024-06-14 16:00:52,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:52,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:52,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 16:00:52,533 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4695121951219512
[2024-06-14 16:00:52,533 INFO  L175             Difference]: Start difference. First operand has 190 places, 249 transitions, 3192 flow. Second operand 8 states and 154 transitions.
[2024-06-14 16:00:52,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 291 transitions, 4170 flow
[2024-06-14 16:00:52,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 291 transitions, 4073 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 16:00:52,694 INFO  L231             Difference]: Finished difference. Result has 191 places, 251 transitions, 3332 flow
[2024-06-14 16:00:52,694 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3095, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3332, PETRI_PLACES=191, PETRI_TRANSITIONS=251}
[2024-06-14 16:00:52,695 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places.
[2024-06-14 16:00:52,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 251 transitions, 3332 flow
[2024-06-14 16:00:52,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:52,695 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:52,695 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:52,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 16:00:52,696 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-14 16:00:52,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:52,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776618748, now seen corresponding path program 2 times
[2024-06-14 16:00:52,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:52,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717811873]
[2024-06-14 16:00:52,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:52,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:52,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:59,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:59,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:59,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717811873]
[2024-06-14 16:00:59,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717811873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:59,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:59,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:00:59,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046097667]
[2024-06-14 16:00:59,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:59,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:00:59,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:59,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:00:59,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:00:59,931 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:59,931 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 251 transitions, 3332 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-14 16:00:59,931 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:59,931 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:59,931 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:01,432 INFO  L124   PetriNetUnfolderBase]: 2715/4086 cut-off events.
[2024-06-14 16:01:01,432 INFO  L125   PetriNetUnfolderBase]: For 157493/157518 co-relation queries the response was YES.
[2024-06-14 16:01:01,457 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31916 conditions, 4086 events. 2715/4086 cut-off events. For 157493/157518 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20377 event pairs, 583 based on Foata normal form. 14/4095 useless extension candidates. Maximal degree in co-relation 31824. Up to 3464 conditions per place. 
[2024-06-14 16:01:01,473 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 195 selfloop transitions, 87 changer transitions 0/285 dead transitions.
[2024-06-14 16:01:01,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 285 transitions, 4150 flow
[2024-06-14 16:01:01,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:01,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:01,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-14 16:01:01,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-14 16:01:01,476 INFO  L175             Difference]: Start difference. First operand has 191 places, 251 transitions, 3332 flow. Second operand 9 states and 157 transitions.
[2024-06-14 16:01:01,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 285 transitions, 4150 flow
[2024-06-14 16:01:01,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 285 transitions, 3933 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-14 16:01:01,672 INFO  L231             Difference]: Finished difference. Result has 194 places, 251 transitions, 3297 flow
[2024-06-14 16:01:01,673 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3115, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3297, PETRI_PLACES=194, PETRI_TRANSITIONS=251}
[2024-06-14 16:01:01,673 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-14 16:01:01,673 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 251 transitions, 3297 flow
[2024-06-14 16:01:01,674 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-14 16:01:01,674 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:01,674 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:01,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 16:01:01,674 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-14 16:01:01,674 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:01,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 408891724, now seen corresponding path program 3 times
[2024-06-14 16:01:01,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:01,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261506706]
[2024-06-14 16:01:01,675 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:01,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:01,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:08,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:08,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:08,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261506706]
[2024-06-14 16:01:08,793 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261506706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:08,793 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:08,793 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:08,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209953177]
[2024-06-14 16:01:08,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:08,794 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:08,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:08,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:08,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:08,946 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:08,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 251 transitions, 3297 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-14 16:01:08,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:08,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:08,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:10,376 INFO  L124   PetriNetUnfolderBase]: 2705/4072 cut-off events.
[2024-06-14 16:01:10,376 INFO  L125   PetriNetUnfolderBase]: For 159017/159042 co-relation queries the response was YES.
[2024-06-14 16:01:10,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31561 conditions, 4072 events. 2705/4072 cut-off events. For 159017/159042 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 20274 event pairs, 578 based on Foata normal form. 14/4081 useless extension candidates. Maximal degree in co-relation 31468. Up to 3456 conditions per place. 
[2024-06-14 16:01:10,416 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 192 selfloop transitions, 87 changer transitions 0/282 dead transitions.
[2024-06-14 16:01:10,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 282 transitions, 3961 flow
[2024-06-14 16:01:10,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:10,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:10,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-14 16:01:10,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41192411924119243
[2024-06-14 16:01:10,419 INFO  L175             Difference]: Start difference. First operand has 194 places, 251 transitions, 3297 flow. Second operand 9 states and 152 transitions.
[2024-06-14 16:01:10,419 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 282 transitions, 3961 flow
[2024-06-14 16:01:10,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 282 transitions, 3725 flow, removed 12 selfloop flow, removed 9 redundant places.
[2024-06-14 16:01:10,624 INFO  L231             Difference]: Finished difference. Result has 194 places, 251 transitions, 3243 flow
[2024-06-14 16:01:10,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3061, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3243, PETRI_PLACES=194, PETRI_TRANSITIONS=251}
[2024-06-14 16:01:10,625 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-14 16:01:10,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 251 transitions, 3243 flow
[2024-06-14 16:01:10,625 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-14 16:01:10,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:10,626 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:10,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 16:01:10,626 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-14 16:01:10,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:10,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548537860, now seen corresponding path program 3 times
[2024-06-14 16:01:10,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:10,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124268797]
[2024-06-14 16:01:10,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:10,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:10,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:18,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:18,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:18,143 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124268797]
[2024-06-14 16:01:18,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124268797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:18,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:18,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:18,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115539933]
[2024-06-14 16:01:18,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:18,144 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:18,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:18,144 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:18,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:18,252 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:18,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 251 transitions, 3243 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-14 16:01:18,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:18,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:18,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:19,720 INFO  L124   PetriNetUnfolderBase]: 2722/4096 cut-off events.
[2024-06-14 16:01:19,720 INFO  L125   PetriNetUnfolderBase]: For 166039/166068 co-relation queries the response was YES.
[2024-06-14 16:01:19,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31859 conditions, 4096 events. 2722/4096 cut-off events. For 166039/166068 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20392 event pairs, 631 based on Foata normal form. 26/4118 useless extension candidates. Maximal degree in co-relation 31765. Up to 3960 conditions per place. 
[2024-06-14 16:01:19,765 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 246 selfloop transitions, 34 changer transitions 0/283 dead transitions.
[2024-06-14 16:01:19,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 283 transitions, 3941 flow
[2024-06-14 16:01:19,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:19,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:19,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-14 16:01:19,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3821138211382114
[2024-06-14 16:01:19,768 INFO  L175             Difference]: Start difference. First operand has 194 places, 251 transitions, 3243 flow. Second operand 9 states and 141 transitions.
[2024-06-14 16:01:19,769 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 283 transitions, 3941 flow
[2024-06-14 16:01:20,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 283 transitions, 3751 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-14 16:01:20,049 INFO  L231             Difference]: Finished difference. Result has 195 places, 253 transitions, 3174 flow
[2024-06-14 16:01:20,049 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3174, PETRI_PLACES=195, PETRI_TRANSITIONS=253}
[2024-06-14 16:01:20,049 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places.
[2024-06-14 16:01:20,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 253 transitions, 3174 flow
[2024-06-14 16:01:20,050 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-14 16:01:20,050 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:20,050 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:20,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 16:01:20,050 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-14 16:01:20,051 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:20,051 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539966980, now seen corresponding path program 4 times
[2024-06-14 16:01:20,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:20,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769584031]
[2024-06-14 16:01:20,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:20,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:20,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:27,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:27,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:27,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769584031]
[2024-06-14 16:01:27,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769584031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:27,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:27,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:27,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500535720]
[2024-06-14 16:01:27,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:27,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:27,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:27,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:27,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:27,694 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:27,695 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 253 transitions, 3174 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-14 16:01:27,695 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:27,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:27,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:29,143 INFO  L124   PetriNetUnfolderBase]: 2739/4123 cut-off events.
[2024-06-14 16:01:29,144 INFO  L125   PetriNetUnfolderBase]: For 174228/174257 co-relation queries the response was YES.
[2024-06-14 16:01:29,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32120 conditions, 4123 events. 2739/4123 cut-off events. For 174228/174257 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 20553 event pairs, 587 based on Foata normal form. 26/4145 useless extension candidates. Maximal degree in co-relation 32025. Up to 3850 conditions per place. 
[2024-06-14 16:01:29,178 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 234 selfloop transitions, 54 changer transitions 0/291 dead transitions.
[2024-06-14 16:01:29,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 291 transitions, 4104 flow
[2024-06-14 16:01:29,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:29,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:29,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-14 16:01:29,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39295392953929537
[2024-06-14 16:01:29,181 INFO  L175             Difference]: Start difference. First operand has 195 places, 253 transitions, 3174 flow. Second operand 9 states and 145 transitions.
[2024-06-14 16:01:29,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 291 transitions, 4104 flow
[2024-06-14 16:01:29,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 291 transitions, 4001 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-14 16:01:29,367 INFO  L231             Difference]: Finished difference. Result has 198 places, 258 transitions, 3309 flow
[2024-06-14 16:01:29,367 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3071, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3309, PETRI_PLACES=198, PETRI_TRANSITIONS=258}
[2024-06-14 16:01:29,368 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places.
[2024-06-14 16:01:29,368 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 258 transitions, 3309 flow
[2024-06-14 16:01:29,368 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-14 16:01:29,368 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:29,368 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:29,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 16:01:29,369 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:29,369 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:29,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548307220, now seen corresponding path program 5 times
[2024-06-14 16:01:29,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:29,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388258057]
[2024-06-14 16:01:29,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:29,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:29,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:36,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:36,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:36,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388258057]
[2024-06-14 16:01:36,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388258057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:36,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:36,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:36,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498844032]
[2024-06-14 16:01:36,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:36,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:36,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:36,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:36,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:36,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:36,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 258 transitions, 3309 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-14 16:01:36,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:36,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:36,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:38,063 INFO  L124   PetriNetUnfolderBase]: 2731/4111 cut-off events.
[2024-06-14 16:01:38,063 INFO  L125   PetriNetUnfolderBase]: For 179522/179551 co-relation queries the response was YES.
[2024-06-14 16:01:38,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32282 conditions, 4111 events. 2731/4111 cut-off events. For 179522/179551 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20497 event pairs, 629 based on Foata normal form. 26/4133 useless extension candidates. Maximal degree in co-relation 32185. Up to 3921 conditions per place. 
[2024-06-14 16:01:38,106 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 241 selfloop transitions, 48 changer transitions 0/292 dead transitions.
[2024-06-14 16:01:38,106 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 292 transitions, 3995 flow
[2024-06-14 16:01:38,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:01:38,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:01:38,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions.
[2024-06-14 16:01:38,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3804878048780488
[2024-06-14 16:01:38,108 INFO  L175             Difference]: Start difference. First operand has 198 places, 258 transitions, 3309 flow. Second operand 10 states and 156 transitions.
[2024-06-14 16:01:38,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 292 transitions, 3995 flow
[2024-06-14 16:01:38,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 292 transitions, 3864 flow, removed 39 selfloop flow, removed 5 redundant places.
[2024-06-14 16:01:38,403 INFO  L231             Difference]: Finished difference. Result has 203 places, 258 transitions, 3284 flow
[2024-06-14 16:01:38,403 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3178, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3284, PETRI_PLACES=203, PETRI_TRANSITIONS=258}
[2024-06-14 16:01:38,404 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places.
[2024-06-14 16:01:38,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 258 transitions, 3284 flow
[2024-06-14 16:01:38,404 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-14 16:01:38,404 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:38,404 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:38,404 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 16:01:38,404 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:38,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:38,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -1123557836, now seen corresponding path program 1 times
[2024-06-14 16:01:38,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:38,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166898961]
[2024-06-14 16:01:38,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:38,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:38,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:45,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:45,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:45,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166898961]
[2024-06-14 16:01:45,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166898961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:45,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:45,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:01:45,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570504134]
[2024-06-14 16:01:45,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:45,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:01:45,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:45,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:01:45,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:01:45,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:45,264 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 258 transitions, 3284 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:45,264 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:45,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:45,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:46,857 INFO  L124   PetriNetUnfolderBase]: 2748/4136 cut-off events.
[2024-06-14 16:01:46,858 INFO  L125   PetriNetUnfolderBase]: For 183071/183075 co-relation queries the response was YES.
[2024-06-14 16:01:46,884 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32532 conditions, 4136 events. 2748/4136 cut-off events. For 183071/183075 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20547 event pairs, 451 based on Foata normal form. 8/4142 useless extension candidates. Maximal degree in co-relation 32433. Up to 3892 conditions per place. 
[2024-06-14 16:01:46,901 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 270 selfloop transitions, 29 changer transitions 0/302 dead transitions.
[2024-06-14 16:01:46,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 302 transitions, 4120 flow
[2024-06-14 16:01:46,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:46,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:46,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-14 16:01:46,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39295392953929537
[2024-06-14 16:01:46,903 INFO  L175             Difference]: Start difference. First operand has 203 places, 258 transitions, 3284 flow. Second operand 9 states and 145 transitions.
[2024-06-14 16:01:46,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 302 transitions, 4120 flow
[2024-06-14 16:01:47,124 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 302 transitions, 4020 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-14 16:01:47,128 INFO  L231             Difference]: Finished difference. Result has 206 places, 266 transitions, 3399 flow
[2024-06-14 16:01:47,128 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3184, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3399, PETRI_PLACES=206, PETRI_TRANSITIONS=266}
[2024-06-14 16:01:47,128 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places.
[2024-06-14 16:01:47,128 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 266 transitions, 3399 flow
[2024-06-14 16:01:47,129 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:47,129 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:47,129 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:47,129 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 16:01:47,129 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:47,129 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:47,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -423441566, now seen corresponding path program 2 times
[2024-06-14 16:01:47,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:47,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275375871]
[2024-06-14 16:01:47,130 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:47,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:47,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:53,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:53,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:53,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275375871]
[2024-06-14 16:01:53,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275375871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:53,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:53,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:01:53,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305609762]
[2024-06-14 16:01:53,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:53,792 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:01:53,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:53,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:01:53,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:01:53,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:53,962 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 266 transitions, 3399 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:53,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:53,962 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:53,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:55,471 INFO  L124   PetriNetUnfolderBase]: 2790/4202 cut-off events.
[2024-06-14 16:01:55,471 INFO  L125   PetriNetUnfolderBase]: For 196903/196907 co-relation queries the response was YES.
[2024-06-14 16:01:55,496 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33588 conditions, 4202 events. 2790/4202 cut-off events. For 196903/196907 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21052 event pairs, 572 based on Foata normal form. 8/4208 useless extension candidates. Maximal degree in co-relation 33486. Up to 3941 conditions per place. 
[2024-06-14 16:01:55,511 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 270 selfloop transitions, 36 changer transitions 0/309 dead transitions.
[2024-06-14 16:01:55,511 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 309 transitions, 4391 flow
[2024-06-14 16:01:55,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:55,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:55,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-14 16:01:55,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-14 16:01:55,514 INFO  L175             Difference]: Start difference. First operand has 206 places, 266 transitions, 3399 flow. Second operand 9 states and 150 transitions.
[2024-06-14 16:01:55,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 309 transitions, 4391 flow
[2024-06-14 16:01:55,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 309 transitions, 4282 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-14 16:01:55,778 INFO  L231             Difference]: Finished difference. Result has 212 places, 271 transitions, 3480 flow
[2024-06-14 16:01:55,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3290, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3480, PETRI_PLACES=212, PETRI_TRANSITIONS=271}
[2024-06-14 16:01:55,778 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-14 16:01:55,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 271 transitions, 3480 flow
[2024-06-14 16:01:55,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:55,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:55,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:55,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 16:01:55,779 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:55,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:55,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -423437846, now seen corresponding path program 3 times
[2024-06-14 16:01:55,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:55,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859873376]
[2024-06-14 16:01:55,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:55,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:55,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:02,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:02,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:02,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859873376]
[2024-06-14 16:02:02,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859873376] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:02,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:02,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:02:02,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100521627]
[2024-06-14 16:02:02,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:02,061 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:02:02,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:02,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:02:02,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:02:02,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:02,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 271 transitions, 3480 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:02,247 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:02,247 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:02,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:03,953 INFO  L124   PetriNetUnfolderBase]: 2782/4190 cut-off events.
[2024-06-14 16:02:03,953 INFO  L125   PetriNetUnfolderBase]: For 203421/203425 co-relation queries the response was YES.
[2024-06-14 16:02:03,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33603 conditions, 4190 events. 2782/4190 cut-off events. For 203421/203425 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20912 event pairs, 572 based on Foata normal form. 8/4196 useless extension candidates. Maximal degree in co-relation 33498. Up to 3981 conditions per place. 
[2024-06-14 16:02:03,992 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 270 selfloop transitions, 35 changer transitions 0/308 dead transitions.
[2024-06-14 16:02:03,992 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 308 transitions, 4235 flow
[2024-06-14 16:02:03,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:03,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:03,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-14 16:02:03,995 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-14 16:02:03,995 INFO  L175             Difference]: Start difference. First operand has 212 places, 271 transitions, 3480 flow. Second operand 9 states and 147 transitions.
[2024-06-14 16:02:03,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 308 transitions, 4235 flow
[2024-06-14 16:02:04,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 308 transitions, 4094 flow, removed 53 selfloop flow, removed 4 redundant places.
[2024-06-14 16:02:04,200 INFO  L231             Difference]: Finished difference. Result has 217 places, 272 transitions, 3444 flow
[2024-06-14 16:02:04,200 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3359, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3444, PETRI_PLACES=217, PETRI_TRANSITIONS=272}
[2024-06-14 16:02:04,201 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places.
[2024-06-14 16:02:04,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 272 transitions, 3444 flow
[2024-06-14 16:02:04,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:04,201 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:04,201 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:04,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 16:02:04,202 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:04,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:04,202 INFO  L85        PathProgramCache]: Analyzing trace with hash -1940313232, now seen corresponding path program 1 times
[2024-06-14 16:02:04,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:04,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111545349]
[2024-06-14 16:02:04,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:04,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:04,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:11,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:11,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:11,474 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111545349]
[2024-06-14 16:02:11,474 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111545349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:11,474 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:11,474 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:11,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290882375]
[2024-06-14 16:02:11,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:11,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:11,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:11,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:11,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:11,631 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:11,631 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 272 transitions, 3444 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-14 16:02:11,631 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:11,631 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:11,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:13,261 INFO  L124   PetriNetUnfolderBase]: 2874/4344 cut-off events.
[2024-06-14 16:02:13,262 INFO  L125   PetriNetUnfolderBase]: For 230345/230347 co-relation queries the response was YES.
[2024-06-14 16:02:13,288 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34440 conditions, 4344 events. 2874/4344 cut-off events. For 230345/230347 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21997 event pairs, 583 based on Foata normal form. 26/4368 useless extension candidates. Maximal degree in co-relation 34333. Up to 3861 conditions per place. 
[2024-06-14 16:02:13,306 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 256 selfloop transitions, 52 changer transitions 0/311 dead transitions.
[2024-06-14 16:02:13,307 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 311 transitions, 4248 flow
[2024-06-14 16:02:13,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:13,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:13,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-14 16:02:13,309 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4173441734417344
[2024-06-14 16:02:13,309 INFO  L175             Difference]: Start difference. First operand has 217 places, 272 transitions, 3444 flow. Second operand 9 states and 154 transitions.
[2024-06-14 16:02:13,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 311 transitions, 4248 flow
[2024-06-14 16:02:13,566 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 311 transitions, 4182 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-14 16:02:13,570 INFO  L231             Difference]: Finished difference. Result has 219 places, 274 transitions, 3541 flow
[2024-06-14 16:02:13,570 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3541, PETRI_PLACES=219, PETRI_TRANSITIONS=274}
[2024-06-14 16:02:13,570 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places.
[2024-06-14 16:02:13,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 274 transitions, 3541 flow
[2024-06-14 16:02:13,570 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-14 16:02:13,570 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:13,571 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:13,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 16:02:13,571 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:13,571 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:13,571 INFO  L85        PathProgramCache]: Analyzing trace with hash -1940305792, now seen corresponding path program 2 times
[2024-06-14 16:02:13,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:13,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336749119]
[2024-06-14 16:02:13,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:13,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:13,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:20,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:20,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:20,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336749119]
[2024-06-14 16:02:20,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336749119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:20,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:20,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:20,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858168697]
[2024-06-14 16:02:20,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:20,748 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:20,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:20,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:20,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:20,892 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:20,892 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 274 transitions, 3541 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-14 16:02:20,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:20,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:20,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:22,563 INFO  L124   PetriNetUnfolderBase]: 3018/4584 cut-off events.
[2024-06-14 16:02:22,563 INFO  L125   PetriNetUnfolderBase]: For 251496/251498 co-relation queries the response was YES.
[2024-06-14 16:02:22,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36933 conditions, 4584 events. 3018/4584 cut-off events. For 251496/251498 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23713 event pairs, 613 based on Foata normal form. 18/4600 useless extension candidates. Maximal degree in co-relation 36825. Up to 3705 conditions per place. 
[2024-06-14 16:02:22,611 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 262 selfloop transitions, 54 changer transitions 0/319 dead transitions.
[2024-06-14 16:02:22,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 319 transitions, 4589 flow
[2024-06-14 16:02:22,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:22,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:22,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-14 16:02:22,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-14 16:02:22,613 INFO  L175             Difference]: Start difference. First operand has 219 places, 274 transitions, 3541 flow. Second operand 9 states and 157 transitions.
[2024-06-14 16:02:22,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 319 transitions, 4589 flow
[2024-06-14 16:02:22,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 319 transitions, 4456 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 16:02:22,935 INFO  L231             Difference]: Finished difference. Result has 221 places, 276 transitions, 3576 flow
[2024-06-14 16:02:22,936 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3408, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3576, PETRI_PLACES=221, PETRI_TRANSITIONS=276}
[2024-06-14 16:02:22,936 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places.
[2024-06-14 16:02:22,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 276 transitions, 3576 flow
[2024-06-14 16:02:22,936 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-14 16:02:22,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:22,936 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:22,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 16:02:22,937 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:22,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:22,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -1946027524, now seen corresponding path program 4 times
[2024-06-14 16:02:22,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:22,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76005916]
[2024-06-14 16:02:22,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:22,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:22,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:29,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-14 16:02:29,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:29,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76005916]
[2024-06-14 16:02:29,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76005916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:29,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:29,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:02:29,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321178844]
[2024-06-14 16:02:29,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:29,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:02:29,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:29,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:02:29,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:02:30,082 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:30,082 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 276 transitions, 3576 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:30,082 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:30,082 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:30,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:31,839 INFO  L124   PetriNetUnfolderBase]: 3010/4572 cut-off events.
[2024-06-14 16:02:31,839 INFO  L125   PetriNetUnfolderBase]: For 244011/244013 co-relation queries the response was YES.
[2024-06-14 16:02:31,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36718 conditions, 4572 events. 3010/4572 cut-off events. For 244011/244013 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23679 event pairs, 652 based on Foata normal form. 6/4576 useless extension candidates. Maximal degree in co-relation 36609. Up to 4284 conditions per place. 
[2024-06-14 16:02:31,885 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 263 selfloop transitions, 45 changer transitions 0/311 dead transitions.
[2024-06-14 16:02:31,885 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 311 transitions, 4352 flow
[2024-06-14 16:02:31,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:31,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:31,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:02:31,887 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 16:02:31,887 INFO  L175             Difference]: Start difference. First operand has 221 places, 276 transitions, 3576 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:02:31,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 311 transitions, 4352 flow
[2024-06-14 16:02:32,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 311 transitions, 4267 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 16:02:32,203 INFO  L231             Difference]: Finished difference. Result has 225 places, 278 transitions, 3644 flow
[2024-06-14 16:02:32,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3493, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3644, PETRI_PLACES=225, PETRI_TRANSITIONS=278}
[2024-06-14 16:02:32,204 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places.
[2024-06-14 16:02:32,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 278 transitions, 3644 flow
[2024-06-14 16:02:32,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:32,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:32,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:32,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 16:02:32,205 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:32,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:32,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1057690782, now seen corresponding path program 5 times
[2024-06-14 16:02:32,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:32,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54781488]
[2024-06-14 16:02:32,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:32,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:32,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:39,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:39,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:39,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54781488]
[2024-06-14 16:02:39,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54781488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:39,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:39,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:02:39,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828158047]
[2024-06-14 16:02:39,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:39,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:02:39,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:39,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:02:39,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:02:39,417 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:39,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 278 transitions, 3644 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:39,418 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:39,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:39,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:41,212 INFO  L124   PetriNetUnfolderBase]: 3027/4599 cut-off events.
[2024-06-14 16:02:41,212 INFO  L125   PetriNetUnfolderBase]: For 253908/253910 co-relation queries the response was YES.
[2024-06-14 16:02:41,243 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37262 conditions, 4599 events. 3027/4599 cut-off events. For 253908/253910 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23854 event pairs, 640 based on Foata normal form. 6/4603 useless extension candidates. Maximal degree in co-relation 37151. Up to 4057 conditions per place. 
[2024-06-14 16:02:41,260 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 260 selfloop transitions, 56 changer transitions 0/319 dead transitions.
[2024-06-14 16:02:41,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 319 transitions, 4510 flow
[2024-06-14 16:02:41,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:41,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:41,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-14 16:02:41,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42005420054200543
[2024-06-14 16:02:41,263 INFO  L175             Difference]: Start difference. First operand has 225 places, 278 transitions, 3644 flow. Second operand 9 states and 155 transitions.
[2024-06-14 16:02:41,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 319 transitions, 4510 flow
[2024-06-14 16:02:41,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 319 transitions, 4375 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-14 16:02:41,624 INFO  L231             Difference]: Finished difference. Result has 228 places, 282 transitions, 3741 flow
[2024-06-14 16:02:41,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3509, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3741, PETRI_PLACES=228, PETRI_TRANSITIONS=282}
[2024-06-14 16:02:41,625 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places.
[2024-06-14 16:02:41,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 282 transitions, 3741 flow
[2024-06-14 16:02:41,625 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:41,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:41,625 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:41,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 16:02:41,625 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:41,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:41,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 1315736296, now seen corresponding path program 6 times
[2024-06-14 16:02:41,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:41,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907013165]
[2024-06-14 16:02:41,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:41,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:41,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:48,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:48,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:48,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907013165]
[2024-06-14 16:02:48,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907013165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:48,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:48,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:02:48,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109987718]
[2024-06-14 16:02:48,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:48,240 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:02:48,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:48,241 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:02:48,241 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:02:48,370 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:48,370 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 282 transitions, 3741 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:48,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:48,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:48,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:50,166 INFO  L124   PetriNetUnfolderBase]: 3119/4754 cut-off events.
[2024-06-14 16:02:50,167 INFO  L125   PetriNetUnfolderBase]: For 290601/290626 co-relation queries the response was YES.
[2024-06-14 16:02:50,198 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38595 conditions, 4754 events. 3119/4754 cut-off events. For 290601/290626 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 25017 event pairs, 622 based on Foata normal form. 34/4783 useless extension candidates. Maximal degree in co-relation 38482. Up to 4000 conditions per place. 
[2024-06-14 16:02:50,216 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 233 selfloop transitions, 84 changer transitions 0/320 dead transitions.
[2024-06-14 16:02:50,217 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 320 transitions, 4575 flow
[2024-06-14 16:02:50,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:50,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:50,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-14 16:02:50,219 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-14 16:02:50,219 INFO  L175             Difference]: Start difference. First operand has 228 places, 282 transitions, 3741 flow. Second operand 9 states and 159 transitions.
[2024-06-14 16:02:50,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 320 transitions, 4575 flow
[2024-06-14 16:02:50,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 320 transitions, 4440 flow, removed 36 selfloop flow, removed 5 redundant places.
[2024-06-14 16:02:50,582 INFO  L231             Difference]: Finished difference. Result has 232 places, 284 transitions, 3844 flow
[2024-06-14 16:02:50,582 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3606, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3844, PETRI_PLACES=232, PETRI_TRANSITIONS=284}
[2024-06-14 16:02:50,583 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places.
[2024-06-14 16:02:50,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 284 transitions, 3844 flow
[2024-06-14 16:02:50,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:50,583 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:50,583 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:50,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 16:02:50,584 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:50,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:50,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1315742248, now seen corresponding path program 3 times
[2024-06-14 16:02:50,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:50,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595291441]
[2024-06-14 16:02:50,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:50,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:50,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:58,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:58,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:58,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595291441]
[2024-06-14 16:02:58,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595291441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:58,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:58,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:02:58,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487555332]
[2024-06-14 16:02:58,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:58,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:02:58,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:58,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:02:58,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:02:58,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:58,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 284 transitions, 3844 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:58,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:58,317 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:58,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:00,251 INFO  L124   PetriNetUnfolderBase]: 3194/4879 cut-off events.
[2024-06-14 16:03:00,251 INFO  L125   PetriNetUnfolderBase]: For 299457/299482 co-relation queries the response was YES.
[2024-06-14 16:03:00,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39810 conditions, 4879 events. 3194/4879 cut-off events. For 299457/299482 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25927 event pairs, 632 based on Foata normal form. 30/4904 useless extension candidates. Maximal degree in co-relation 39695. Up to 4005 conditions per place. 
[2024-06-14 16:03:00,303 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 238 selfloop transitions, 85 changer transitions 0/326 dead transitions.
[2024-06-14 16:03:00,304 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 326 transitions, 4682 flow
[2024-06-14 16:03:00,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:03:00,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:03:00,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-14 16:03:00,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.424390243902439
[2024-06-14 16:03:00,306 INFO  L175             Difference]: Start difference. First operand has 232 places, 284 transitions, 3844 flow. Second operand 10 states and 174 transitions.
[2024-06-14 16:03:00,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 326 transitions, 4682 flow
[2024-06-14 16:03:00,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 326 transitions, 4472 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-14 16:03:00,648 INFO  L231             Difference]: Finished difference. Result has 235 places, 285 transitions, 3849 flow
[2024-06-14 16:03:00,648 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3634, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3849, PETRI_PLACES=235, PETRI_TRANSITIONS=285}
[2024-06-14 16:03:00,648 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places.
[2024-06-14 16:03:00,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 285 transitions, 3849 flow
[2024-06-14 16:03:00,648 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:00,649 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:00,649 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:00,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 16:03:00,649 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:00,649 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:00,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310229766, now seen corresponding path program 7 times
[2024-06-14 16:03:00,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:00,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695811902]
[2024-06-14 16:03:00,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:00,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:00,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:07,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:07,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:07,474 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695811902]
[2024-06-14 16:03:07,474 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695811902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:07,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:07,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:03:07,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848304458]
[2024-06-14 16:03:07,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:07,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:03:07,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:07,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:03:07,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:03:07,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:07,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 285 transitions, 3849 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:07,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:07,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:07,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:09,441 INFO  L124   PetriNetUnfolderBase]: 3211/4906 cut-off events.
[2024-06-14 16:03:09,441 INFO  L125   PetriNetUnfolderBase]: For 289672/289697 co-relation queries the response was YES.
[2024-06-14 16:03:09,475 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40031 conditions, 4906 events. 3211/4906 cut-off events. For 289672/289697 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26134 event pairs, 685 based on Foata normal form. 14/4915 useless extension candidates. Maximal degree in co-relation 39915. Up to 4493 conditions per place. 
[2024-06-14 16:03:09,494 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 253 selfloop transitions, 66 changer transitions 0/322 dead transitions.
[2024-06-14 16:03:09,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 322 transitions, 4692 flow
[2024-06-14 16:03:09,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:03:09,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:03:09,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:03:09,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 16:03:09,495 INFO  L175             Difference]: Start difference. First operand has 235 places, 285 transitions, 3849 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:03:09,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 322 transitions, 4692 flow
[2024-06-14 16:03:09,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 322 transitions, 4500 flow, removed 11 selfloop flow, removed 8 redundant places.
[2024-06-14 16:03:09,908 INFO  L231             Difference]: Finished difference. Result has 237 places, 291 transitions, 3923 flow
[2024-06-14 16:03:09,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3664, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3923, PETRI_PLACES=237, PETRI_TRANSITIONS=291}
[2024-06-14 16:03:09,909 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places.
[2024-06-14 16:03:09,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 291 transitions, 3923 flow
[2024-06-14 16:03:09,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:09,909 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:09,909 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:09,909 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 16:03:09,910 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:09,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:09,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 1315951498, now seen corresponding path program 4 times
[2024-06-14 16:03:09,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:09,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539611062]
[2024-06-14 16:03:09,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:09,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:09,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:16,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:16,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:16,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539611062]
[2024-06-14 16:03:16,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539611062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:16,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:16,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:03:16,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627682785]
[2024-06-14 16:03:16,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:16,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:03:16,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:16,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:03:16,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:03:16,935 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:16,936 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 291 transitions, 3923 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-14 16:03:16,936 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:16,936 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:16,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:18,734 INFO  L124   PetriNetUnfolderBase]: 3380/5185 cut-off events.
[2024-06-14 16:03:18,734 INFO  L125   PetriNetUnfolderBase]: For 342698/342723 co-relation queries the response was YES.
[2024-06-14 16:03:18,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42805 conditions, 5185 events. 3380/5185 cut-off events. For 342698/342723 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 28078 event pairs, 675 based on Foata normal form. 26/5206 useless extension candidates. Maximal degree in co-relation 42687. Up to 3997 conditions per place. 
[2024-06-14 16:03:18,793 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 241 selfloop transitions, 90 changer transitions 0/334 dead transitions.
[2024-06-14 16:03:18,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 334 transitions, 5021 flow
[2024-06-14 16:03:18,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:03:18,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:03:18,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-14 16:03:18,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 16:03:18,796 INFO  L175             Difference]: Start difference. First operand has 237 places, 291 transitions, 3923 flow. Second operand 9 states and 162 transitions.
[2024-06-14 16:03:18,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 334 transitions, 5021 flow
[2024-06-14 16:03:19,180 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 334 transitions, 4823 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-14 16:03:19,184 INFO  L231             Difference]: Finished difference. Result has 239 places, 293 transitions, 3985 flow
[2024-06-14 16:03:19,185 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3725, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3985, PETRI_PLACES=239, PETRI_TRANSITIONS=293}
[2024-06-14 16:03:19,185 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places.
[2024-06-14 16:03:19,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 293 transitions, 3985 flow
[2024-06-14 16:03:19,185 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-14 16:03:19,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:19,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:19,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 16:03:19,186 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:19,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:19,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310226046, now seen corresponding path program 8 times
[2024-06-14 16:03:19,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:19,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665069708]
[2024-06-14 16:03:19,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:19,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:19,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:26,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:26,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:26,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665069708]
[2024-06-14 16:03:26,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665069708] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:26,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:26,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:03:26,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486460410]
[2024-06-14 16:03:26,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:26,131 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:03:26,131 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:26,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:03:26,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:03:26,311 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:26,312 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 293 transitions, 3985 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-14 16:03:26,312 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:26,312 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:26,312 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:28,351 INFO  L124   PetriNetUnfolderBase]: 3508/5393 cut-off events.
[2024-06-14 16:03:28,351 INFO  L125   PetriNetUnfolderBase]: For 370401/370426 co-relation queries the response was YES.
[2024-06-14 16:03:28,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45452 conditions, 5393 events. 3508/5393 cut-off events. For 370401/370426 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29569 event pairs, 706 based on Foata normal form. 14/5402 useless extension candidates. Maximal degree in co-relation 45333. Up to 4390 conditions per place. 
[2024-06-14 16:03:28,408 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 234 selfloop transitions, 99 changer transitions 0/336 dead transitions.
[2024-06-14 16:03:28,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 336 transitions, 5149 flow
[2024-06-14 16:03:28,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:03:28,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:03:28,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:03:28,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43360433604336046
[2024-06-14 16:03:28,411 INFO  L175             Difference]: Start difference. First operand has 239 places, 293 transitions, 3985 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:03:28,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 336 transitions, 5149 flow
[2024-06-14 16:03:28,818 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 336 transitions, 5011 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 16:03:28,823 INFO  L231             Difference]: Finished difference. Result has 244 places, 298 transitions, 4227 flow
[2024-06-14 16:03:28,823 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3847, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4227, PETRI_PLACES=244, PETRI_TRANSITIONS=298}
[2024-06-14 16:03:28,823 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places.
[2024-06-14 16:03:28,823 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 298 transitions, 4227 flow
[2024-06-14 16:03:28,823 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-14 16:03:28,823 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:28,823 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:28,824 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 16:03:28,824 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:28,824 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:28,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310379868, now seen corresponding path program 5 times
[2024-06-14 16:03:28,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:28,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313867293]
[2024-06-14 16:03:28,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:28,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:28,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:36,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:36,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:36,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313867293]
[2024-06-14 16:03:36,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313867293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:36,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:36,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:03:36,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511494516]
[2024-06-14 16:03:36,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:36,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:03:36,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:36,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:03:36,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:03:36,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:36,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 298 transitions, 4227 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:36,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:36,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:36,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:38,947 INFO  L124   PetriNetUnfolderBase]: 3533/5440 cut-off events.
[2024-06-14 16:03:38,947 INFO  L125   PetriNetUnfolderBase]: For 393169/393194 co-relation queries the response was YES.
[2024-06-14 16:03:38,983 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45891 conditions, 5440 events. 3533/5440 cut-off events. For 393169/393194 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29987 event pairs, 714 based on Foata normal form. 30/5465 useless extension candidates. Maximal degree in co-relation 45769. Up to 4686 conditions per place. 
[2024-06-14 16:03:39,003 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 243 selfloop transitions, 94 changer transitions 0/340 dead transitions.
[2024-06-14 16:03:39,003 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 340 transitions, 5089 flow
[2024-06-14 16:03:39,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:03:39,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:03:39,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-14 16:03:39,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4219512195121951
[2024-06-14 16:03:39,006 INFO  L175             Difference]: Start difference. First operand has 244 places, 298 transitions, 4227 flow. Second operand 10 states and 173 transitions.
[2024-06-14 16:03:39,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 340 transitions, 5089 flow
[2024-06-14 16:03:39,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 340 transitions, 4871 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:39,482 INFO  L231             Difference]: Finished difference. Result has 248 places, 299 transitions, 4237 flow
[2024-06-14 16:03:39,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4009, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4237, PETRI_PLACES=248, PETRI_TRANSITIONS=299}
[2024-06-14 16:03:39,482 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places.
[2024-06-14 16:03:39,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 299 transitions, 4237 flow
[2024-06-14 16:03:39,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:39,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:39,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:39,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 16:03:39,483 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:39,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:39,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -209262646, now seen corresponding path program 9 times
[2024-06-14 16:03:39,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:39,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275068595]
[2024-06-14 16:03:39,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:39,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:39,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:46,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:46,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:46,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275068595]
[2024-06-14 16:03:46,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275068595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:46,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:46,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:03:46,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313955449]
[2024-06-14 16:03:46,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:46,409 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:03:46,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:46,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:03:46,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:03:46,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:46,554 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 299 transitions, 4237 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:46,554 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:46,554 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:46,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:48,562 INFO  L124   PetriNetUnfolderBase]: 3489/5372 cut-off events.
[2024-06-14 16:03:48,562 INFO  L125   PetriNetUnfolderBase]: For 372180/372205 co-relation queries the response was YES.
[2024-06-14 16:03:48,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44189 conditions, 5372 events. 3489/5372 cut-off events. For 372180/372205 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29572 event pairs, 694 based on Foata normal form. 34/5401 useless extension candidates. Maximal degree in co-relation 44066. Up to 4618 conditions per place. 
[2024-06-14 16:03:48,621 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 240 selfloop transitions, 93 changer transitions 0/336 dead transitions.
[2024-06-14 16:03:48,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 336 transitions, 5074 flow
[2024-06-14 16:03:48,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:03:48,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:03:48,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-14 16:03:48,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-14 16:03:48,623 INFO  L175             Difference]: Start difference. First operand has 248 places, 299 transitions, 4237 flow. Second operand 9 states and 157 transitions.
[2024-06-14 16:03:48,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 336 transitions, 5074 flow
[2024-06-14 16:03:49,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 336 transitions, 4836 flow, removed 28 selfloop flow, removed 8 redundant places.
[2024-06-14 16:03:49,201 INFO  L231             Difference]: Finished difference. Result has 249 places, 300 transitions, 4225 flow
[2024-06-14 16:03:49,201 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4009, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4225, PETRI_PLACES=249, PETRI_TRANSITIONS=300}
[2024-06-14 16:03:49,202 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places.
[2024-06-14 16:03:49,202 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 300 transitions, 4225 flow
[2024-06-14 16:03:49,202 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:49,202 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:49,202 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:49,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 16:03:49,202 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:49,203 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:49,203 INFO  L85        PathProgramCache]: Analyzing trace with hash -209256694, now seen corresponding path program 6 times
[2024-06-14 16:03:49,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:49,203 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80971924]
[2024-06-14 16:03:49,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:49,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:49,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:57,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:57,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:57,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80971924]
[2024-06-14 16:03:57,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80971924] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:57,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:57,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:03:57,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159442299]
[2024-06-14 16:03:57,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:57,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:03:57,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:57,036 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:03:57,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:03:57,243 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:57,243 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 300 transitions, 4225 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:57,243 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:57,243 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:57,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:59,345 INFO  L124   PetriNetUnfolderBase]: 3564/5497 cut-off events.
[2024-06-14 16:03:59,345 INFO  L125   PetriNetUnfolderBase]: For 379503/379528 co-relation queries the response was YES.
[2024-06-14 16:03:59,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44852 conditions, 5497 events. 3564/5497 cut-off events. For 379503/379528 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 30484 event pairs, 718 based on Foata normal form. 30/5522 useless extension candidates. Maximal degree in co-relation 44728. Up to 4623 conditions per place. 
[2024-06-14 16:03:59,408 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 244 selfloop transitions, 94 changer transitions 0/341 dead transitions.
[2024-06-14 16:03:59,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 341 transitions, 5095 flow
[2024-06-14 16:03:59,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:03:59,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:03:59,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions.
[2024-06-14 16:03:59,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 16:03:59,411 INFO  L175             Difference]: Start difference. First operand has 249 places, 300 transitions, 4225 flow. Second operand 10 states and 170 transitions.
[2024-06-14 16:03:59,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 341 transitions, 5095 flow
[2024-06-14 16:03:59,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 341 transitions, 4902 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 16:03:59,937 INFO  L231             Difference]: Finished difference. Result has 252 places, 301 transitions, 4274 flow
[2024-06-14 16:03:59,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4032, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4274, PETRI_PLACES=252, PETRI_TRANSITIONS=301}
[2024-06-14 16:03:59,938 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places.
[2024-06-14 16:03:59,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 301 transitions, 4274 flow
[2024-06-14 16:03:59,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:59,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:59,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:59,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 16:03:59,938 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:59,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:59,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 56649836, now seen corresponding path program 7 times
[2024-06-14 16:03:59,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:59,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281925736]
[2024-06-14 16:03:59,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:59,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:59,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:06,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:06,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:06,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281925736]
[2024-06-14 16:04:06,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281925736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:06,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:06,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:06,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607860345]
[2024-06-14 16:04:06,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:06,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:06,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:06,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:06,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:07,059 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:07,059 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 301 transitions, 4274 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-14 16:04:07,059 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:07,059 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:07,059 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:08,997 INFO  L124   PetriNetUnfolderBase]: 3683/5698 cut-off events.
[2024-06-14 16:04:08,997 INFO  L125   PetriNetUnfolderBase]: For 408608/408633 co-relation queries the response was YES.
[2024-06-14 16:04:09,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46999 conditions, 5698 events. 3683/5698 cut-off events. For 408608/408633 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31863 event pairs, 687 based on Foata normal form. 26/5719 useless extension candidates. Maximal degree in co-relation 46874. Up to 3339 conditions per place. 
[2024-06-14 16:04:09,075 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 232 selfloop transitions, 109 changer transitions 0/344 dead transitions.
[2024-06-14 16:04:09,075 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 344 transitions, 5420 flow
[2024-06-14 16:04:09,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:04:09,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:04:09,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-14 16:04:09,078 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4281842818428184
[2024-06-14 16:04:09,078 INFO  L175             Difference]: Start difference. First operand has 252 places, 301 transitions, 4274 flow. Second operand 9 states and 158 transitions.
[2024-06-14 16:04:09,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 344 transitions, 5420 flow
[2024-06-14 16:04:09,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 344 transitions, 5210 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-14 16:04:09,812 INFO  L231             Difference]: Finished difference. Result has 253 places, 303 transitions, 4374 flow
[2024-06-14 16:04:09,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4064, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4374, PETRI_PLACES=253, PETRI_TRANSITIONS=303}
[2024-06-14 16:04:09,813 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places.
[2024-06-14 16:04:09,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 303 transitions, 4374 flow
[2024-06-14 16:04:09,813 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-14 16:04:09,814 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:09,814 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:09,814 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 16:04:09,814 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:09,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:09,815 INFO  L85        PathProgramCache]: Analyzing trace with hash -209047444, now seen corresponding path program 8 times
[2024-06-14 16:04:09,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:09,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637027196]
[2024-06-14 16:04:09,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:09,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:09,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:16,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:16,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:16,781 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637027196]
[2024-06-14 16:04:16,781 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637027196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:16,781 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:16,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:16,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987839853]
[2024-06-14 16:04:16,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:16,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:16,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:16,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:16,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:17,001 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:17,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 303 transitions, 4374 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-14 16:04:17,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:17,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:17,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:19,090 INFO  L124   PetriNetUnfolderBase]: 3691/5718 cut-off events.
[2024-06-14 16:04:19,090 INFO  L125   PetriNetUnfolderBase]: For 409575/409600 co-relation queries the response was YES.
[2024-06-14 16:04:19,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46884 conditions, 5718 events. 3691/5718 cut-off events. For 409575/409600 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32190 event pairs, 754 based on Foata normal form. 26/5739 useless extension candidates. Maximal degree in co-relation 46758. Up to 4611 conditions per place. 
[2024-06-14 16:04:19,164 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 247 selfloop transitions, 95 changer transitions 0/345 dead transitions.
[2024-06-14 16:04:19,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 345 transitions, 5490 flow
[2024-06-14 16:04:19,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:04:19,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:04:19,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:04:19,166 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43360433604336046
[2024-06-14 16:04:19,166 INFO  L175             Difference]: Start difference. First operand has 253 places, 303 transitions, 4374 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:04:19,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 345 transitions, 5490 flow
[2024-06-14 16:04:19,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 345 transitions, 5341 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-14 16:04:19,715 INFO  L231             Difference]: Finished difference. Result has 257 places, 304 transitions, 4466 flow
[2024-06-14 16:04:19,715 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4229, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4466, PETRI_PLACES=257, PETRI_TRANSITIONS=304}
[2024-06-14 16:04:19,715 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places.
[2024-06-14 16:04:19,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 304 transitions, 4466 flow
[2024-06-14 16:04:19,716 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-14 16:04:19,716 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:19,716 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:19,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 16:04:19,716 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-14 16:04:19,717 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:19,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -846974204, now seen corresponding path program 1 times
[2024-06-14 16:04:19,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:19,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885729435]
[2024-06-14 16:04:19,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:19,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:19,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:28,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:28,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:28,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885729435]
[2024-06-14 16:04:28,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885729435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:28,033 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:28,033 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:04:28,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44400135]
[2024-06-14 16:04:28,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:28,033 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:04:28,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:28,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:04:28,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:04:28,114 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:28,114 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 304 transitions, 4466 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-14 16:04:28,114 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:28,115 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:28,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:30,118 INFO  L124   PetriNetUnfolderBase]: 3696/5724 cut-off events.
[2024-06-14 16:04:30,118 INFO  L125   PetriNetUnfolderBase]: For 394593/394593 co-relation queries the response was YES.
[2024-06-14 16:04:30,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47270 conditions, 5724 events. 3696/5724 cut-off events. For 394593/394593 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32343 event pairs, 887 based on Foata normal form. 1/5723 useless extension candidates. Maximal degree in co-relation 47142. Up to 5668 conditions per place. 
[2024-06-14 16:04:30,184 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 303 selfloop transitions, 21 changer transitions 0/327 dead transitions.
[2024-06-14 16:04:30,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 327 transitions, 5434 flow
[2024-06-14 16:04:30,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:04:30,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:04:30,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-14 16:04:30,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3832752613240418
[2024-06-14 16:04:30,187 INFO  L175             Difference]: Start difference. First operand has 257 places, 304 transitions, 4466 flow. Second operand 7 states and 110 transitions.
[2024-06-14 16:04:30,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 327 transitions, 5434 flow
[2024-06-14 16:04:30,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 327 transitions, 5173 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-14 16:04:30,816 INFO  L231             Difference]: Finished difference. Result has 257 places, 310 transitions, 4415 flow
[2024-06-14 16:04:30,816 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4205, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4415, PETRI_PLACES=257, PETRI_TRANSITIONS=310}
[2024-06-14 16:04:30,817 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places.
[2024-06-14 16:04:30,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 310 transitions, 4415 flow
[2024-06-14 16:04:30,817 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-14 16:04:30,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:30,817 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:30,817 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 16:04:30,818 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-14 16:04:30,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:30,818 INFO  L85        PathProgramCache]: Analyzing trace with hash -846854234, now seen corresponding path program 2 times
[2024-06-14 16:04:30,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:30,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891523449]
[2024-06-14 16:04:30,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:30,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:30,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:38,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:38,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:38,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891523449]
[2024-06-14 16:04:38,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891523449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:38,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:38,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:04:38,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253707885]
[2024-06-14 16:04:38,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:38,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:04:38,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:38,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:04:38,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:04:38,848 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:38,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 310 transitions, 4415 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-14 16:04:38,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:38,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:38,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:40,737 INFO  L124   PetriNetUnfolderBase]: 3706/5738 cut-off events.
[2024-06-14 16:04:40,738 INFO  L125   PetriNetUnfolderBase]: For 401039/401039 co-relation queries the response was YES.
[2024-06-14 16:04:40,785 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46942 conditions, 5738 events. 3706/5738 cut-off events. For 401039/401039 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32404 event pairs, 887 based on Foata normal form. 1/5737 useless extension candidates. Maximal degree in co-relation 46813. Up to 5694 conditions per place. 
[2024-06-14 16:04:40,808 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 307 selfloop transitions, 19 changer transitions 0/329 dead transitions.
[2024-06-14 16:04:40,808 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 329 transitions, 5225 flow
[2024-06-14 16:04:40,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:04:40,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:04:40,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-14 16:04:40,809 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36585365853658536
[2024-06-14 16:04:40,809 INFO  L175             Difference]: Start difference. First operand has 257 places, 310 transitions, 4415 flow. Second operand 7 states and 105 transitions.
[2024-06-14 16:04:40,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 329 transitions, 5225 flow
[2024-06-14 16:04:41,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 329 transitions, 5119 flow, removed 44 selfloop flow, removed 3 redundant places.
[2024-06-14 16:04:41,593 INFO  L231             Difference]: Finished difference. Result has 261 places, 316 transitions, 4479 flow
[2024-06-14 16:04:41,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4320, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4479, PETRI_PLACES=261, PETRI_TRANSITIONS=316}
[2024-06-14 16:04:41,594 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places.
[2024-06-14 16:04:41,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 316 transitions, 4479 flow
[2024-06-14 16:04:41,594 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-14 16:04:41,594 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:41,594 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:41,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:04:41,595 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-14 16:04:41,595 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:41,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -1924145160, now seen corresponding path program 1 times
[2024-06-14 16:04:41,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:41,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100322806]
[2024-06-14 16:04:41,595 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:41,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:41,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:49,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:49,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:49,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100322806]
[2024-06-14 16:04:49,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100322806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:49,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:49,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:04:49,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134754711]
[2024-06-14 16:04:49,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:49,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:04:49,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:49,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:04:49,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:04:49,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:49,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 316 transitions, 4479 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-14 16:04:49,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:49,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:49,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:51,440 INFO  L124   PetriNetUnfolderBase]: 3746/5792 cut-off events.
[2024-06-14 16:04:51,440 INFO  L125   PetriNetUnfolderBase]: For 417915/417944 co-relation queries the response was YES.
[2024-06-14 16:04:51,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47461 conditions, 5792 events. 3746/5792 cut-off events. For 417915/417944 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32668 event pairs, 846 based on Foata normal form. 26/5814 useless extension candidates. Maximal degree in co-relation 47330. Up to 5612 conditions per place. 
[2024-06-14 16:04:51,500 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 296 selfloop transitions, 47 changer transitions 0/346 dead transitions.
[2024-06-14 16:04:51,500 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 346 transitions, 5490 flow
[2024-06-14 16:04:51,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:04:51,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:04:51,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-14 16:04:51,502 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-14 16:04:51,502 INFO  L175             Difference]: Start difference. First operand has 261 places, 316 transitions, 4479 flow. Second operand 7 states and 116 transitions.
[2024-06-14 16:04:51,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 346 transitions, 5490 flow
[2024-06-14 16:04:52,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 346 transitions, 5390 flow, removed 34 selfloop flow, removed 4 redundant places.
[2024-06-14 16:04:52,105 INFO  L231             Difference]: Finished difference. Result has 265 places, 327 transitions, 4620 flow
[2024-06-14 16:04:52,105 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4379, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4620, PETRI_PLACES=265, PETRI_TRANSITIONS=327}
[2024-06-14 16:04:52,105 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 223 predicate places.
[2024-06-14 16:04:52,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 327 transitions, 4620 flow
[2024-06-14 16:04:52,106 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-14 16:04:52,106 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:52,106 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:52,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:04:52,106 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-14 16:04:52,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:52,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043900502, now seen corresponding path program 2 times
[2024-06-14 16:04:52,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:52,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017773252]
[2024-06-14 16:04:52,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:52,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:52,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:59,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-14 16:04:59,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:59,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017773252]
[2024-06-14 16:04:59,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017773252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:59,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:59,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:04:59,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541490027]
[2024-06-14 16:04:59,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:59,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:04:59,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:59,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:04:59,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:05:00,084 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:00,084 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 327 transitions, 4620 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-14 16:05:00,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:00,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:00,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:02,020 INFO  L124   PetriNetUnfolderBase]: 3766/5820 cut-off events.
[2024-06-14 16:05:02,020 INFO  L125   PetriNetUnfolderBase]: For 429397/429426 co-relation queries the response was YES.
[2024-06-14 16:05:02,068 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47995 conditions, 5820 events. 3766/5820 cut-off events. For 429397/429426 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32861 event pairs, 826 based on Foata normal form. 26/5842 useless extension candidates. Maximal degree in co-relation 47862. Up to 5628 conditions per place. 
[2024-06-14 16:05:02,091 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 294 selfloop transitions, 51 changer transitions 0/348 dead transitions.
[2024-06-14 16:05:02,091 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 348 transitions, 5557 flow
[2024-06-14 16:05:02,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:05:02,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:05:02,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 16:05:02,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 16:05:02,093 INFO  L175             Difference]: Start difference. First operand has 265 places, 327 transitions, 4620 flow. Second operand 6 states and 102 transitions.
[2024-06-14 16:05:02,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 348 transitions, 5557 flow
[2024-06-14 16:05:02,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 348 transitions, 5483 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-14 16:05:02,774 INFO  L231             Difference]: Finished difference. Result has 268 places, 331 transitions, 4719 flow
[2024-06-14 16:05:02,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4549, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4719, PETRI_PLACES=268, PETRI_TRANSITIONS=331}
[2024-06-14 16:05:02,775 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places.
[2024-06-14 16:05:02,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 331 transitions, 4719 flow
[2024-06-14 16:05:02,775 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-14 16:05:02,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:02,775 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:02,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 16:05:02,775 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-14 16:05:02,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:02,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 388453606, now seen corresponding path program 3 times
[2024-06-14 16:05:02,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:02,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848543712]
[2024-06-14 16:05:02,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:02,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:02,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:10,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:10,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:10,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848543712]
[2024-06-14 16:05:10,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848543712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:10,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:10,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:05:10,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757643300]
[2024-06-14 16:05:10,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:10,517 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:05:10,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:10,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:05:10,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:05:10,644 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:10,644 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 331 transitions, 4719 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-14 16:05:10,644 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:10,644 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:10,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:12,563 INFO  L124   PetriNetUnfolderBase]: 3763/5818 cut-off events.
[2024-06-14 16:05:12,563 INFO  L125   PetriNetUnfolderBase]: For 433551/433551 co-relation queries the response was YES.
[2024-06-14 16:05:12,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48126 conditions, 5818 events. 3763/5818 cut-off events. For 433551/433551 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32867 event pairs, 857 based on Foata normal form. 1/5817 useless extension candidates. Maximal degree in co-relation 47992. Up to 5768 conditions per place. 
[2024-06-14 16:05:12,642 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 324 selfloop transitions, 19 changer transitions 0/346 dead transitions.
[2024-06-14 16:05:12,642 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 346 transitions, 5451 flow
[2024-06-14 16:05:12,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:05:12,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:05:12,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-14 16:05:12,643 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-14 16:05:12,643 INFO  L175             Difference]: Start difference. First operand has 268 places, 331 transitions, 4719 flow. Second operand 6 states and 98 transitions.
[2024-06-14 16:05:12,643 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 346 transitions, 5451 flow
[2024-06-14 16:05:13,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 346 transitions, 5325 flow, removed 37 selfloop flow, removed 3 redundant places.
[2024-06-14 16:05:13,563 INFO  L231             Difference]: Finished difference. Result has 271 places, 331 transitions, 4641 flow
[2024-06-14 16:05:13,564 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4593, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4641, PETRI_PLACES=271, PETRI_TRANSITIONS=331}
[2024-06-14 16:05:13,564 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 229 predicate places.
[2024-06-14 16:05:13,564 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 331 transitions, 4641 flow
[2024-06-14 16:05:13,565 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-14 16:05:13,565 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:13,565 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:13,565 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 16:05:13,565 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:13,565 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:13,566 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044137652, now seen corresponding path program 3 times
[2024-06-14 16:05:13,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:13,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160842330]
[2024-06-14 16:05:13,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:13,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:13,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:20,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:20,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:20,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160842330]
[2024-06-14 16:05:20,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160842330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:20,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:20,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:05:20,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390539018]
[2024-06-14 16:05:20,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:20,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:05:20,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:21,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:05:21,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:05:21,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:21,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 331 transitions, 4641 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-14 16:05:21,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:21,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:21,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:23,108 INFO  L124   PetriNetUnfolderBase]: 3740/5783 cut-off events.
[2024-06-14 16:05:23,108 INFO  L125   PetriNetUnfolderBase]: For 431043/431072 co-relation queries the response was YES.
[2024-06-14 16:05:23,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47485 conditions, 5783 events. 3740/5783 cut-off events. For 431043/431072 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32654 event pairs, 833 based on Foata normal form. 26/5805 useless extension candidates. Maximal degree in co-relation 47350. Up to 5708 conditions per place. 
[2024-06-14 16:05:23,175 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 316 selfloop transitions, 24 changer transitions 0/343 dead transitions.
[2024-06-14 16:05:23,175 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 343 transitions, 5371 flow
[2024-06-14 16:05:23,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:05:23,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:05:23,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-14 16:05:23,176 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3861788617886179
[2024-06-14 16:05:23,176 INFO  L175             Difference]: Start difference. First operand has 271 places, 331 transitions, 4641 flow. Second operand 6 states and 95 transitions.
[2024-06-14 16:05:23,176 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 343 transitions, 5371 flow
[2024-06-14 16:05:23,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 343 transitions, 5319 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-14 16:05:23,745 INFO  L231             Difference]: Finished difference. Result has 272 places, 331 transitions, 4644 flow
[2024-06-14 16:05:23,745 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4589, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4644, PETRI_PLACES=272, PETRI_TRANSITIONS=331}
[2024-06-14 16:05:23,746 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places.
[2024-06-14 16:05:23,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 331 transitions, 4644 flow
[2024-06-14 16:05:23,746 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-14 16:05:23,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:23,746 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:23,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 16:05:23,746 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:23,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:23,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044146580, now seen corresponding path program 1 times
[2024-06-14 16:05:23,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:23,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574000346]
[2024-06-14 16:05:23,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:23,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:23,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:34,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:34,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:34,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574000346]
[2024-06-14 16:05:34,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574000346] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:34,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:34,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:05:34,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534171669]
[2024-06-14 16:05:34,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:34,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:05:34,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:34,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:05:34,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:05:34,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:34,179 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 331 transitions, 4644 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-14 16:05:34,179 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:34,179 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:34,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:36,190 INFO  L124   PetriNetUnfolderBase]: 3743/5788 cut-off events.
[2024-06-14 16:05:36,190 INFO  L125   PetriNetUnfolderBase]: For 439395/439424 co-relation queries the response was YES.
[2024-06-14 16:05:36,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47641 conditions, 5788 events. 3743/5788 cut-off events. For 439395/439424 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32602 event pairs, 832 based on Foata normal form. 26/5810 useless extension candidates. Maximal degree in co-relation 47505. Up to 5702 conditions per place. 
[2024-06-14 16:05:36,263 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 315 selfloop transitions, 28 changer transitions 0/346 dead transitions.
[2024-06-14 16:05:36,264 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 346 transitions, 5428 flow
[2024-06-14 16:05:36,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:05:36,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:05:36,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 16:05:36,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 16:05:36,266 INFO  L175             Difference]: Start difference. First operand has 272 places, 331 transitions, 4644 flow. Second operand 6 states and 96 transitions.
[2024-06-14 16:05:36,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 346 transitions, 5428 flow
[2024-06-14 16:05:36,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 346 transitions, 5299 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 16:05:36,911 INFO  L231             Difference]: Finished difference. Result has 272 places, 334 transitions, 4641 flow
[2024-06-14 16:05:36,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4515, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4641, PETRI_PLACES=272, PETRI_TRANSITIONS=334}
[2024-06-14 16:05:36,912 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places.
[2024-06-14 16:05:36,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 334 transitions, 4641 flow
[2024-06-14 16:05:36,912 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-14 16:05:36,912 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:36,912 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-14 16:05:36,912 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 16:05:36,912 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:36,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:36,913 INFO  L85        PathProgramCache]: Analyzing trace with hash -1049789613, now seen corresponding path program 1 times
[2024-06-14 16:05:36,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:36,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029538618]
[2024-06-14 16:05:36,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:36,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:36,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:43,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:43,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:43,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029538618]
[2024-06-14 16:05:43,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029538618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:43,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:43,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:43,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178616273]
[2024-06-14 16:05:43,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:43,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:43,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:43,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:43,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:43,816 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:43,816 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 334 transitions, 4641 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-14 16:05:43,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:43,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:43,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:46,030 INFO  L124   PetriNetUnfolderBase]: 3784/5859 cut-off events.
[2024-06-14 16:05:46,030 INFO  L125   PetriNetUnfolderBase]: For 466393/466395 co-relation queries the response was YES.
[2024-06-14 16:05:46,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48392 conditions, 5859 events. 3784/5859 cut-off events. For 466393/466395 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33080 event pairs, 684 based on Foata normal form. 14/5871 useless extension candidates. Maximal degree in co-relation 48256. Up to 5544 conditions per place. 
[2024-06-14 16:05:46,098 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 339 selfloop transitions, 28 changer transitions 0/370 dead transitions.
[2024-06-14 16:05:46,098 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 370 transitions, 5527 flow
[2024-06-14 16:05:46,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:46,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:46,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-14 16:05:46,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 16:05:46,101 INFO  L175             Difference]: Start difference. First operand has 272 places, 334 transitions, 4641 flow. Second operand 9 states and 144 transitions.
[2024-06-14 16:05:46,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 370 transitions, 5527 flow
[2024-06-14 16:05:46,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 370 transitions, 5423 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-14 16:05:46,759 INFO  L231             Difference]: Finished difference. Result has 277 places, 335 transitions, 4645 flow
[2024-06-14 16:05:46,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4537, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4645, PETRI_PLACES=277, PETRI_TRANSITIONS=335}
[2024-06-14 16:05:46,759 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places.
[2024-06-14 16:05:46,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 335 transitions, 4645 flow
[2024-06-14 16:05:46,759 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-14 16:05:46,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:46,760 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-14 16:05:46,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 16:05:46,760 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:46,760 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:46,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -2010535485, now seen corresponding path program 2 times
[2024-06-14 16:05:46,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:46,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144637490]
[2024-06-14 16:05:46,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:46,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:46,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:54,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-14 16:05:54,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:54,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144637490]
[2024-06-14 16:05:54,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144637490] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:54,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:54,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:54,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423010829]
[2024-06-14 16:05:54,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:54,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:54,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:54,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:54,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:54,969 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:54,969 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 335 transitions, 4645 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-14 16:05:54,969 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:54,970 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:54,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:57,340 INFO  L124   PetriNetUnfolderBase]: 3825/5930 cut-off events.
[2024-06-14 16:05:57,340 INFO  L125   PetriNetUnfolderBase]: For 481763/481765 co-relation queries the response was YES.
[2024-06-14 16:05:57,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49064 conditions, 5930 events. 3825/5930 cut-off events. For 481763/481765 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 33820 event pairs, 841 based on Foata normal form. 14/5942 useless extension candidates. Maximal degree in co-relation 48927. Up to 5435 conditions per place. 
[2024-06-14 16:05:57,413 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 314 selfloop transitions, 55 changer transitions 0/372 dead transitions.
[2024-06-14 16:05:57,413 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 372 transitions, 5557 flow
[2024-06-14 16:05:57,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:57,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:57,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-14 16:05:57,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4010840108401084
[2024-06-14 16:05:57,415 INFO  L175             Difference]: Start difference. First operand has 277 places, 335 transitions, 4645 flow. Second operand 9 states and 148 transitions.
[2024-06-14 16:05:57,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 372 transitions, 5557 flow
[2024-06-14 16:05:58,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 372 transitions, 5467 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-14 16:05:58,104 INFO  L231             Difference]: Finished difference. Result has 280 places, 337 transitions, 4755 flow
[2024-06-14 16:05:58,104 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4555, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4755, PETRI_PLACES=280, PETRI_TRANSITIONS=337}
[2024-06-14 16:05:58,105 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places.
[2024-06-14 16:05:58,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 337 transitions, 4755 flow
[2024-06-14 16:05:58,105 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-14 16:05:58,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:58,105 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-14 16:05:58,105 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 16:05:58,105 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:58,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:58,106 INFO  L85        PathProgramCache]: Analyzing trace with hash -2010420165, now seen corresponding path program 3 times
[2024-06-14 16:05:58,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:58,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543145072]
[2024-06-14 16:05:58,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:58,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:58,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:05,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:05,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:05,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543145072]
[2024-06-14 16:06:05,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543145072] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:05,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:05,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-14 16:06:05,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264957440]
[2024-06-14 16:06:05,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:05,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-14 16:06:05,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:05,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-14 16:06:05,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2024-06-14 16:06:06,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:06:06,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 337 transitions, 4755 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:06,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:06,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:06:06,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:08,449 INFO  L124   PetriNetUnfolderBase]: 3866/5999 cut-off events.
[2024-06-14 16:06:08,449 INFO  L125   PetriNetUnfolderBase]: For 497200/497204 co-relation queries the response was YES.
[2024-06-14 16:06:08,508 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49676 conditions, 5999 events. 3866/5999 cut-off events. For 497200/497204 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34319 event pairs, 864 based on Foata normal form. 16/6013 useless extension candidates. Maximal degree in co-relation 49537. Up to 5721 conditions per place. 
[2024-06-14 16:06:08,534 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 342 selfloop transitions, 36 changer transitions 0/381 dead transitions.
[2024-06-14 16:06:08,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 381 transitions, 5684 flow
[2024-06-14 16:06:08,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:06:08,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:06:08,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions.
[2024-06-14 16:06:08,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-14 16:06:08,537 INFO  L175             Difference]: Start difference. First operand has 280 places, 337 transitions, 4755 flow. Second operand 10 states and 162 transitions.
[2024-06-14 16:06:08,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 381 transitions, 5684 flow
[2024-06-14 16:06:09,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 381 transitions, 5536 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-14 16:06:09,405 INFO  L231             Difference]: Finished difference. Result has 284 places, 338 transitions, 4714 flow
[2024-06-14 16:06:09,405 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4607, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4714, PETRI_PLACES=284, PETRI_TRANSITIONS=338}
[2024-06-14 16:06:09,405 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 242 predicate places.
[2024-06-14 16:06:09,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 338 transitions, 4714 flow
[2024-06-14 16:06:09,406 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:09,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:09,406 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-14 16:06:09,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 16:06:09,406 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-14 16:06:09,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:09,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 66361608, now seen corresponding path program 1 times
[2024-06-14 16:06:09,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:09,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589378408]
[2024-06-14 16:06:09,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:09,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:09,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:20,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:20,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:20,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589378408]
[2024-06-14 16:06:20,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589378408] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:20,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:20,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:06:20,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202931705]
[2024-06-14 16:06:20,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:20,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:06:20,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:20,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:06:20,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:06:20,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:06:20,723 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 338 transitions, 4714 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-14 16:06:20,723 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:20,723 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:06:20,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:22,921 INFO  L124   PetriNetUnfolderBase]: 3906/6057 cut-off events.
[2024-06-14 16:06:22,921 INFO  L125   PetriNetUnfolderBase]: For 495992/496021 co-relation queries the response was YES.
[2024-06-14 16:06:22,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49928 conditions, 6057 events. 3906/6057 cut-off events. For 495992/496021 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34723 event pairs, 884 based on Foata normal form. 26/6079 useless extension candidates. Maximal degree in co-relation 49788. Up to 5803 conditions per place. 
[2024-06-14 16:06:22,999 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 308 selfloop transitions, 63 changer transitions 0/374 dead transitions.
[2024-06-14 16:06:22,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 374 transitions, 5867 flow
[2024-06-14 16:06:23,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:06:23,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:06:23,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-14 16:06:23,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41114982578397213
[2024-06-14 16:06:23,001 INFO  L175             Difference]: Start difference. First operand has 284 places, 338 transitions, 4714 flow. Second operand 7 states and 118 transitions.
[2024-06-14 16:06:23,001 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 374 transitions, 5867 flow
[2024-06-14 16:06:23,797 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 374 transitions, 5781 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-14 16:06:23,802 INFO  L231             Difference]: Finished difference. Result has 284 places, 351 transitions, 4968 flow
[2024-06-14 16:06:23,802 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4628, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4968, PETRI_PLACES=284, PETRI_TRANSITIONS=351}
[2024-06-14 16:06:23,802 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 242 predicate places.
[2024-06-14 16:06:23,802 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 351 transitions, 4968 flow
[2024-06-14 16:06:23,802 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-14 16:06:23,802 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:23,803 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-14 16:06:23,803 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 16:06:23,803 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:23,803 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:23,803 INFO  L85        PathProgramCache]: Analyzing trace with hash -1518849959, now seen corresponding path program 4 times
[2024-06-14 16:06:23,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:23,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877145688]
[2024-06-14 16:06:23,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:23,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:23,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:31,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:31,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:31,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877145688]
[2024-06-14 16:06:31,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877145688] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:31,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:31,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:06:31,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488924850]
[2024-06-14 16:06:31,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:31,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:06:31,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:31,223 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:06:31,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:06:31,484 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:06:31,485 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 351 transitions, 4968 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-14 16:06:31,485 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:31,485 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:06:31,485 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:33,706 INFO  L124   PetriNetUnfolderBase]: 3886/6025 cut-off events.
[2024-06-14 16:06:33,706 INFO  L125   PetriNetUnfolderBase]: For 497841/497843 co-relation queries the response was YES.
[2024-06-14 16:06:33,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49207 conditions, 6025 events. 3886/6025 cut-off events. For 497841/497843 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34408 event pairs, 834 based on Foata normal form. 14/6037 useless extension candidates. Maximal degree in co-relation 49065. Up to 5548 conditions per place. 
[2024-06-14 16:06:33,779 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 331 selfloop transitions, 52 changer transitions 0/386 dead transitions.
[2024-06-14 16:06:33,780 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 5850 flow
[2024-06-14 16:06:33,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:06:33,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:06:33,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-14 16:06:33,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4010840108401084
[2024-06-14 16:06:33,782 INFO  L175             Difference]: Start difference. First operand has 284 places, 351 transitions, 4968 flow. Second operand 9 states and 148 transitions.
[2024-06-14 16:06:33,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 5850 flow
[2024-06-14 16:06:34,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 386 transitions, 5754 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 16:06:34,725 INFO  L231             Difference]: Finished difference. Result has 290 places, 351 transitions, 4985 flow
[2024-06-14 16:06:34,725 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4872, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4985, PETRI_PLACES=290, PETRI_TRANSITIONS=351}
[2024-06-14 16:06:34,725 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places.
[2024-06-14 16:06:34,726 INFO  L495      AbstractCegarLoop]: Abstraction has has 290 places, 351 transitions, 4985 flow
[2024-06-14 16:06:34,726 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-14 16:06:34,726 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:34,726 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-14 16:06:34,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 16:06:34,726 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-14 16:06:34,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:34,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -1902230870, now seen corresponding path program 2 times
[2024-06-14 16:06:34,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:34,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830490166]
[2024-06-14 16:06:34,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:34,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:34,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:46,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:46,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:46,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830490166]
[2024-06-14 16:06:46,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830490166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:46,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:46,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:06:46,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394097494]
[2024-06-14 16:06:46,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:46,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:06:46,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:46,189 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:06:46,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:06:46,312 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:06:46,312 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 351 transitions, 4985 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-14 16:06:46,312 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:46,312 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:06:46,313 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:48,555 INFO  L124   PetriNetUnfolderBase]: 3906/6056 cut-off events.
[2024-06-14 16:06:48,555 INFO  L125   PetriNetUnfolderBase]: For 498818/498843 co-relation queries the response was YES.
[2024-06-14 16:06:48,606 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49593 conditions, 6056 events. 3906/6056 cut-off events. For 498818/498843 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 34689 event pairs, 900 based on Foata normal form. 14/6065 useless extension candidates. Maximal degree in co-relation 49450. Up to 5787 conditions per place. 
[2024-06-14 16:06:48,632 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 298 selfloop transitions, 68 changer transitions 0/369 dead transitions.
[2024-06-14 16:06:48,632 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 369 transitions, 5947 flow
[2024-06-14 16:06:48,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:06:48,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:06:48,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 16:06:48,633 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 16:06:48,633 INFO  L175             Difference]: Start difference. First operand has 290 places, 351 transitions, 4985 flow. Second operand 6 states and 102 transitions.
[2024-06-14 16:06:48,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 369 transitions, 5947 flow
[2024-06-14 16:06:49,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 369 transitions, 5824 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-14 16:06:49,444 INFO  L231             Difference]: Finished difference. Result has 289 places, 354 transitions, 5031 flow
[2024-06-14 16:06:49,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4864, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5031, PETRI_PLACES=289, PETRI_TRANSITIONS=354}
[2024-06-14 16:06:49,445 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places.
[2024-06-14 16:06:49,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 354 transitions, 5031 flow
[2024-06-14 16:06:49,445 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-14 16:06:49,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:49,445 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-14 16:06:49,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 16:06:49,445 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-14 16:06:49,446 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:49,446 INFO  L85        PathProgramCache]: Analyzing trace with hash -594271840, now seen corresponding path program 3 times
[2024-06-14 16:06:49,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:49,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019437397]
[2024-06-14 16:06:49,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:49,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:49,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:00,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:00,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:00,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019437397]
[2024-06-14 16:07:00,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019437397] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:00,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:00,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:00,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55591241]
[2024-06-14 16:07:00,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:00,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:00,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:00,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:00,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:00,882 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:07:00,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 354 transitions, 5031 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-14 16:07:00,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:00,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:07:00,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:03,219 INFO  L124   PetriNetUnfolderBase]: 3894/6037 cut-off events.
[2024-06-14 16:07:03,219 INFO  L125   PetriNetUnfolderBase]: For 487132/487161 co-relation queries the response was YES.
[2024-06-14 16:07:03,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49115 conditions, 6037 events. 3894/6037 cut-off events. For 487132/487161 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 34545 event pairs, 856 based on Foata normal form. 26/6059 useless extension candidates. Maximal degree in co-relation 48971. Up to 5779 conditions per place. 
[2024-06-14 16:07:03,288 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 303 selfloop transitions, 68 changer transitions 0/374 dead transitions.
[2024-06-14 16:07:03,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 374 transitions, 5863 flow
[2024-06-14 16:07:03,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:07:03,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:07:03,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-14 16:07:03,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-14 16:07:03,290 INFO  L175             Difference]: Start difference. First operand has 289 places, 354 transitions, 5031 flow. Second operand 6 states and 105 transitions.
[2024-06-14 16:07:03,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 374 transitions, 5863 flow
[2024-06-14 16:07:04,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 374 transitions, 5723 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 16:07:04,187 INFO  L231             Difference]: Finished difference. Result has 291 places, 354 transitions, 5045 flow
[2024-06-14 16:07:04,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4891, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5045, PETRI_PLACES=291, PETRI_TRANSITIONS=354}
[2024-06-14 16:07:04,188 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places.
[2024-06-14 16:07:04,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 354 transitions, 5045 flow
[2024-06-14 16:07:04,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-14 16:07:04,188 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:04,188 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-14 16:07:04,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 16:07:04,188 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:04,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:04,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -19267007, now seen corresponding path program 5 times
[2024-06-14 16:07:04,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:04,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926475718]
[2024-06-14 16:07:04,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:04,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:04,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:11,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:11,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:11,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926475718]
[2024-06-14 16:07:11,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926475718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:11,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:11,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:07:11,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827626046]
[2024-06-14 16:07:11,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:11,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:07:11,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:11,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:07:11,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:07:11,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:07:11,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 354 transitions, 5045 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-14 16:07:11,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:11,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:07:11,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:13,697 INFO  L124   PetriNetUnfolderBase]: 3874/6008 cut-off events.
[2024-06-14 16:07:13,697 INFO  L125   PetriNetUnfolderBase]: For 489816/489841 co-relation queries the response was YES.
[2024-06-14 16:07:13,756 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48391 conditions, 6008 events. 3874/6008 cut-off events. For 489816/489841 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 34286 event pairs, 798 based on Foata normal form. 22/6025 useless extension candidates. Maximal degree in co-relation 48247. Up to 5526 conditions per place. 
[2024-06-14 16:07:13,782 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 317 selfloop transitions, 69 changer transitions 0/389 dead transitions.
[2024-06-14 16:07:13,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 389 transitions, 5950 flow
[2024-06-14 16:07:13,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:13,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:13,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-14 16:07:13,784 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-14 16:07:13,784 INFO  L175             Difference]: Start difference. First operand has 291 places, 354 transitions, 5045 flow. Second operand 9 states and 150 transitions.
[2024-06-14 16:07:13,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 389 transitions, 5950 flow
[2024-06-14 16:07:14,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 389 transitions, 5779 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-14 16:07:14,751 INFO  L231             Difference]: Finished difference. Result has 295 places, 355 transitions, 5040 flow
[2024-06-14 16:07:14,751 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4874, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5040, PETRI_PLACES=295, PETRI_TRANSITIONS=355}
[2024-06-14 16:07:14,751 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 253 predicate places.
[2024-06-14 16:07:14,751 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 355 transitions, 5040 flow
[2024-06-14 16:07:14,751 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-14 16:07:14,751 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:14,752 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-14 16:07:14,752 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 16:07:14,752 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:14,752 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:14,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 238810871, now seen corresponding path program 6 times
[2024-06-14 16:07:14,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:14,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759732184]
[2024-06-14 16:07:14,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:14,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:14,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:22,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:22,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:22,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759732184]
[2024-06-14 16:07:22,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759732184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:22,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:22,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:07:22,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841012142]
[2024-06-14 16:07:22,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:22,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:07:22,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:22,191 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:07:22,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:07:22,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:07:22,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 355 transitions, 5040 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-14 16:07:22,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:22,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:07:22,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:24,685 INFO  L124   PetriNetUnfolderBase]: 3854/5976 cut-off events.
[2024-06-14 16:07:24,686 INFO  L125   PetriNetUnfolderBase]: For 466126/466151 co-relation queries the response was YES.
[2024-06-14 16:07:24,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47519 conditions, 5976 events. 3854/5976 cut-off events. For 466126/466151 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 34068 event pairs, 794 based on Foata normal form. 22/5993 useless extension candidates. Maximal degree in co-relation 47374. Up to 5466 conditions per place. 
[2024-06-14 16:07:24,767 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 320 selfloop transitions, 67 changer transitions 0/390 dead transitions.
[2024-06-14 16:07:24,767 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 390 transitions, 5948 flow
[2024-06-14 16:07:24,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:24,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:24,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-14 16:07:24,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4092140921409214
[2024-06-14 16:07:24,770 INFO  L175             Difference]: Start difference. First operand has 295 places, 355 transitions, 5040 flow. Second operand 9 states and 151 transitions.
[2024-06-14 16:07:24,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 390 transitions, 5948 flow
[2024-06-14 16:07:25,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 390 transitions, 5814 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 16:07:25,731 INFO  L231             Difference]: Finished difference. Result has 300 places, 356 transitions, 5073 flow
[2024-06-14 16:07:25,731 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4906, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5073, PETRI_PLACES=300, PETRI_TRANSITIONS=356}
[2024-06-14 16:07:25,731 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 258 predicate places.
[2024-06-14 16:07:25,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 300 places, 356 transitions, 5073 flow
[2024-06-14 16:07:25,732 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-14 16:07:25,732 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:25,732 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-14 16:07:25,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 16:07:25,732 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:25,732 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:25,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 2061654467, now seen corresponding path program 7 times
[2024-06-14 16:07:25,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:25,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233783074]
[2024-06-14 16:07:25,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:25,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:25,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:33,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:33,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:33,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233783074]
[2024-06-14 16:07:33,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233783074] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:33,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:33,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:07:33,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245669858]
[2024-06-14 16:07:33,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:33,663 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:07:33,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:33,663 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:07:33,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:07:33,931 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:07:33,931 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 356 transitions, 5073 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-14 16:07:33,931 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:33,931 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:07:33,931 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:36,140 INFO  L124   PetriNetUnfolderBase]: 3834/5944 cut-off events.
[2024-06-14 16:07:36,140 INFO  L125   PetriNetUnfolderBase]: For 452988/453013 co-relation queries the response was YES.
[2024-06-14 16:07:36,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46639 conditions, 5944 events. 3834/5944 cut-off events. For 452988/453013 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 33810 event pairs, 768 based on Foata normal form. 22/5961 useless extension candidates. Maximal degree in co-relation 46492. Up to 5385 conditions per place. 
[2024-06-14 16:07:36,226 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 315 selfloop transitions, 71 changer transitions 0/389 dead transitions.
[2024-06-14 16:07:36,226 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 389 transitions, 5833 flow
[2024-06-14 16:07:36,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:36,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:36,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:07:36,228 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 16:07:36,228 INFO  L175             Difference]: Start difference. First operand has 300 places, 356 transitions, 5073 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:07:36,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 389 transitions, 5833 flow
[2024-06-14 16:07:37,134 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 389 transitions, 5640 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-14 16:07:37,139 INFO  L231             Difference]: Finished difference. Result has 301 places, 355 transitions, 4902 flow
[2024-06-14 16:07:37,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4756, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4902, PETRI_PLACES=301, PETRI_TRANSITIONS=355}
[2024-06-14 16:07:37,140 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places.
[2024-06-14 16:07:37,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 355 transitions, 4902 flow
[2024-06-14 16:07:37,140 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-14 16:07:37,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:37,140 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-14 16:07:37,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-14 16:07:37,140 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-14 16:07:37,140 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:37,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 477227837, now seen corresponding path program 1 times
[2024-06-14 16:07:37,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:37,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755583665]
[2024-06-14 16:07:37,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:37,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:37,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:46,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:46,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:46,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755583665]
[2024-06-14 16:07:46,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755583665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:46,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:46,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:46,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007220316]
[2024-06-14 16:07:46,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:46,104 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:46,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:46,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:46,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:46,239 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:07:46,239 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 355 transitions, 4902 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-14 16:07:46,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:46,239 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:07:46,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:48,179 INFO  L124   PetriNetUnfolderBase]: 3839/5950 cut-off events.
[2024-06-14 16:07:48,179 INFO  L125   PetriNetUnfolderBase]: For 439768/439768 co-relation queries the response was YES.
[2024-06-14 16:07:48,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46743 conditions, 5950 events. 3839/5950 cut-off events. For 439768/439768 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 33899 event pairs, 861 based on Foata normal form. 1/5949 useless extension candidates. Maximal degree in co-relation 46595. Up to 5871 conditions per place. 
[2024-06-14 16:07:48,264 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 344 selfloop transitions, 35 changer transitions 0/382 dead transitions.
[2024-06-14 16:07:48,264 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 382 transitions, 5988 flow
[2024-06-14 16:07:48,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:07:48,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:07:48,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-14 16:07:48,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 16:07:48,265 INFO  L175             Difference]: Start difference. First operand has 301 places, 355 transitions, 4902 flow. Second operand 8 states and 124 transitions.
[2024-06-14 16:07:48,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 382 transitions, 5988 flow
[2024-06-14 16:07:49,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 382 transitions, 5667 flow, removed 26 selfloop flow, removed 10 redundant places.
[2024-06-14 16:07:49,282 INFO  L231             Difference]: Finished difference. Result has 299 places, 361 transitions, 4787 flow
[2024-06-14 16:07:49,282 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4581, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4787, PETRI_PLACES=299, PETRI_TRANSITIONS=361}
[2024-06-14 16:07:49,282 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places.
[2024-06-14 16:07:49,282 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 361 transitions, 4787 flow
[2024-06-14 16:07:49,282 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-14 16:07:49,282 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:49,282 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-14 16:07:49,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-14 16:07:49,283 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-14 16:07:49,283 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:49,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 477318202, now seen corresponding path program 1 times
[2024-06-14 16:07:49,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:49,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231484904]
[2024-06-14 16:07:49,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:49,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:49,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:57,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:57,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:57,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231484904]
[2024-06-14 16:07:57,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231484904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:57,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:57,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:57,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194009008]
[2024-06-14 16:07:57,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:57,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:57,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:57,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:57,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:57,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:07:57,516 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 361 transitions, 4787 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-14 16:07:57,516 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:57,516 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:07:57,516 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:59,597 INFO  L124   PetriNetUnfolderBase]: 3903/6037 cut-off events.
[2024-06-14 16:07:59,597 INFO  L125   PetriNetUnfolderBase]: For 473688/473717 co-relation queries the response was YES.
[2024-06-14 16:07:59,647 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47416 conditions, 6037 events. 3903/6037 cut-off events. For 473688/473717 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34408 event pairs, 822 based on Foata normal form. 26/6059 useless extension candidates. Maximal degree in co-relation 47270. Up to 5697 conditions per place. 
[2024-06-14 16:07:59,671 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 327 selfloop transitions, 69 changer transitions 0/399 dead transitions.
[2024-06-14 16:07:59,672 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 399 transitions, 6339 flow
[2024-06-14 16:07:59,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:07:59,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:07:59,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-14 16:07:59,673 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-14 16:07:59,673 INFO  L175             Difference]: Start difference. First operand has 299 places, 361 transitions, 4787 flow. Second operand 8 states and 134 transitions.
[2024-06-14 16:07:59,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 399 transitions, 6339 flow
[2024-06-14 16:08:00,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 399 transitions, 6241 flow, removed 33 selfloop flow, removed 4 redundant places.
[2024-06-14 16:08:00,578 INFO  L231             Difference]: Finished difference. Result has 304 places, 372 transitions, 5158 flow
[2024-06-14 16:08:00,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4689, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5158, PETRI_PLACES=304, PETRI_TRANSITIONS=372}
[2024-06-14 16:08:00,578 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places.
[2024-06-14 16:08:00,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 372 transitions, 5158 flow
[2024-06-14 16:08:00,578 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-14 16:08:00,578 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:00,578 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-14 16:08:00,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-14 16:08:00,579 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-14 16:08:00,579 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:00,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -486395849, now seen corresponding path program 2 times
[2024-06-14 16:08:00,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:00,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653135111]
[2024-06-14 16:08:00,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:00,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:00,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:09,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:09,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:09,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653135111]
[2024-06-14 16:08:09,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653135111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:09,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:09,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:09,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902335762]
[2024-06-14 16:08:09,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:09,966 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:09,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:09,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:09,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:10,117 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:08:10,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 372 transitions, 5158 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-14 16:08:10,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:10,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:08:10,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:12,188 INFO  L124   PetriNetUnfolderBase]: 3908/6046 cut-off events.
[2024-06-14 16:08:12,188 INFO  L125   PetriNetUnfolderBase]: For 481160/481160 co-relation queries the response was YES.
[2024-06-14 16:08:12,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48313 conditions, 6046 events. 3908/6046 cut-off events. For 481160/481160 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34466 event pairs, 842 based on Foata normal form. 1/6045 useless extension candidates. Maximal degree in co-relation 48164. Up to 5984 conditions per place. 
[2024-06-14 16:08:12,263 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 359 selfloop transitions, 30 changer transitions 0/392 dead transitions.
[2024-06-14 16:08:12,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 392 transitions, 6044 flow
[2024-06-14 16:08:12,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:08:12,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:08:12,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions.
[2024-06-14 16:08:12,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3628048780487805
[2024-06-14 16:08:12,264 INFO  L175             Difference]: Start difference. First operand has 304 places, 372 transitions, 5158 flow. Second operand 8 states and 119 transitions.
[2024-06-14 16:08:12,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 392 transitions, 6044 flow
[2024-06-14 16:08:13,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 392 transitions, 5845 flow, removed 74 selfloop flow, removed 3 redundant places.
[2024-06-14 16:08:13,405 INFO  L231             Difference]: Finished difference. Result has 309 places, 375 transitions, 5089 flow
[2024-06-14 16:08:13,405 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4959, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5089, PETRI_PLACES=309, PETRI_TRANSITIONS=375}
[2024-06-14 16:08:13,406 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 267 predicate places.
[2024-06-14 16:08:13,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 375 transitions, 5089 flow
[2024-06-14 16:08:13,406 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-14 16:08:13,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:13,406 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-14 16:08:13,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-14 16:08:13,406 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-14 16:08:13,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:13,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -482676624, now seen corresponding path program 2 times
[2024-06-14 16:08:13,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:13,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114526012]
[2024-06-14 16:08:13,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:13,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:13,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:21,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:21,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:21,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114526012]
[2024-06-14 16:08:21,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114526012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:21,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:21,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:21,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079137860]
[2024-06-14 16:08:21,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:21,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:21,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:21,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:21,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:21,811 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:08:21,811 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 375 transitions, 5089 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-14 16:08:21,811 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:21,811 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:08:21,811 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:23,911 INFO  L124   PetriNetUnfolderBase]: 3972/6133 cut-off events.
[2024-06-14 16:08:23,912 INFO  L125   PetriNetUnfolderBase]: For 515256/515285 co-relation queries the response was YES.
[2024-06-14 16:08:23,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49413 conditions, 6133 events. 3972/6133 cut-off events. For 515256/515285 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 35005 event pairs, 809 based on Foata normal form. 26/6155 useless extension candidates. Maximal degree in co-relation 49262. Up to 5889 conditions per place. 
[2024-06-14 16:08:24,001 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 346 selfloop transitions, 56 changer transitions 0/405 dead transitions.
[2024-06-14 16:08:24,001 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 405 transitions, 6367 flow
[2024-06-14 16:08:24,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:08:24,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:08:24,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-14 16:08:24,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3932926829268293
[2024-06-14 16:08:24,003 INFO  L175             Difference]: Start difference. First operand has 309 places, 375 transitions, 5089 flow. Second operand 8 states and 129 transitions.
[2024-06-14 16:08:24,003 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 405 transitions, 6367 flow
[2024-06-14 16:08:25,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 405 transitions, 6265 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-14 16:08:25,296 INFO  L231             Difference]: Finished difference. Result has 312 places, 383 transitions, 5328 flow
[2024-06-14 16:08:25,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4987, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5328, PETRI_PLACES=312, PETRI_TRANSITIONS=383}
[2024-06-14 16:08:25,296 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 270 predicate places.
[2024-06-14 16:08:25,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 383 transitions, 5328 flow
[2024-06-14 16:08:25,296 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-14 16:08:25,296 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:25,296 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-14 16:08:25,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-14 16:08:25,297 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-14 16:08:25,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:25,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 1314917882, now seen corresponding path program 3 times
[2024-06-14 16:08:25,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:25,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478334226]
[2024-06-14 16:08:25,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:25,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:25,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:33,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-14 16:08:33,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:33,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478334226]
[2024-06-14 16:08:33,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478334226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:33,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:33,531 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:33,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723919605]
[2024-06-14 16:08:33,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:33,531 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:33,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:33,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:33,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:33,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:08:33,708 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 383 transitions, 5328 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-14 16:08:33,708 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:33,708 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:08:33,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:35,849 INFO  L124   PetriNetUnfolderBase]: 3976/6139 cut-off events.
[2024-06-14 16:08:35,849 INFO  L125   PetriNetUnfolderBase]: For 525806/525835 co-relation queries the response was YES.
[2024-06-14 16:08:35,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49877 conditions, 6139 events. 3976/6139 cut-off events. For 525806/525835 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 34991 event pairs, 823 based on Foata normal form. 26/6161 useless extension candidates. Maximal degree in co-relation 49724. Up to 5896 conditions per place. 
[2024-06-14 16:08:35,931 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 345 selfloop transitions, 64 changer transitions 0/412 dead transitions.
[2024-06-14 16:08:35,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 412 transitions, 6531 flow
[2024-06-14 16:08:35,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:08:35,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:08:35,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-14 16:08:35,933 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 16:08:35,933 INFO  L175             Difference]: Start difference. First operand has 312 places, 383 transitions, 5328 flow. Second operand 10 states and 155 transitions.
[2024-06-14 16:08:35,933 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 412 transitions, 6531 flow
[2024-06-14 16:08:37,202 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 412 transitions, 6362 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-14 16:08:37,208 INFO  L231             Difference]: Finished difference. Result has 318 places, 387 transitions, 5401 flow
[2024-06-14 16:08:37,208 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5173, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5401, PETRI_PLACES=318, PETRI_TRANSITIONS=387}
[2024-06-14 16:08:37,208 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places.
[2024-06-14 16:08:37,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 387 transitions, 5401 flow
[2024-06-14 16:08:37,209 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-14 16:08:37,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:37,209 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-14 16:08:37,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-14 16:08:37,209 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-14 16:08:37,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:37,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 481037117, now seen corresponding path program 3 times
[2024-06-14 16:08:37,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:37,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10705915]
[2024-06-14 16:08:37,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:37,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:37,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:46,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:46,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:46,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10705915]
[2024-06-14 16:08:46,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10705915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:46,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:46,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:46,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369119761]
[2024-06-14 16:08:46,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:46,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:46,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:46,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:46,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:46,503 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:08:46,504 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 387 transitions, 5401 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-14 16:08:46,504 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:46,504 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:08:46,504 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:48,656 INFO  L124   PetriNetUnfolderBase]: 3981/6148 cut-off events.
[2024-06-14 16:08:48,656 INFO  L125   PetriNetUnfolderBase]: For 526497/526497 co-relation queries the response was YES.
[2024-06-14 16:08:48,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50063 conditions, 6148 events. 3981/6148 cut-off events. For 526497/526497 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 35063 event pairs, 875 based on Foata normal form. 1/6147 useless extension candidates. Maximal degree in co-relation 49908. Up to 6101 conditions per place. 
[2024-06-14 16:08:48,744 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 379 selfloop transitions, 22 changer transitions 0/404 dead transitions.
[2024-06-14 16:08:48,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 404 transitions, 6307 flow
[2024-06-14 16:08:48,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:08:48,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:08:48,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions.
[2024-06-14 16:08:48,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35060975609756095
[2024-06-14 16:08:48,745 INFO  L175             Difference]: Start difference. First operand has 318 places, 387 transitions, 5401 flow. Second operand 8 states and 115 transitions.
[2024-06-14 16:08:48,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 404 transitions, 6307 flow
[2024-06-14 16:08:50,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 404 transitions, 6113 flow, removed 34 selfloop flow, removed 8 redundant places.
[2024-06-14 16:08:50,116 INFO  L231             Difference]: Finished difference. Result has 318 places, 390 transitions, 5327 flow
[2024-06-14 16:08:50,116 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5207, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5327, PETRI_PLACES=318, PETRI_TRANSITIONS=390}
[2024-06-14 16:08:50,116 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places.
[2024-06-14 16:08:50,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 390 transitions, 5327 flow
[2024-06-14 16:08:50,117 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-14 16:08:50,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:50,117 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-14 16:08:50,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-14 16:08:50,117 INFO  L420      AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:50,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:50,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -842833668, now seen corresponding path program 4 times
[2024-06-14 16:08:50,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:50,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477115228]
[2024-06-14 16:08:50,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:50,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:50,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:58,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-14 16:08:58,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:58,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477115228]
[2024-06-14 16:08:58,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477115228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:58,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:58,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:58,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62262963]
[2024-06-14 16:08:58,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:58,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:58,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:58,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:58,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:58,334 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:08:58,335 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 390 transitions, 5327 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-14 16:08:58,335 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:58,335 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:08:58,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:00,660 INFO  L124   PetriNetUnfolderBase]: 4033/6218 cut-off events.
[2024-06-14 16:09:00,660 INFO  L125   PetriNetUnfolderBase]: For 562504/562533 co-relation queries the response was YES.
[2024-06-14 16:09:00,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51000 conditions, 6218 events. 4033/6218 cut-off events. For 562504/562533 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 35439 event pairs, 852 based on Foata normal form. 26/6240 useless extension candidates. Maximal degree in co-relation 50844. Up to 5940 conditions per place. 
[2024-06-14 16:09:00,740 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 358 selfloop transitions, 59 changer transitions 0/420 dead transitions.
[2024-06-14 16:09:00,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 420 transitions, 6833 flow
[2024-06-14 16:09:00,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:09:00,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:09:00,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-14 16:09:00,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-14 16:09:00,741 INFO  L175             Difference]: Start difference. First operand has 318 places, 390 transitions, 5327 flow. Second operand 7 states and 117 transitions.
[2024-06-14 16:09:00,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 420 transitions, 6833 flow
[2024-06-14 16:09:02,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 420 transitions, 6741 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 16:09:02,033 INFO  L231             Difference]: Finished difference. Result has 321 places, 399 transitions, 5666 flow
[2024-06-14 16:09:02,034 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5235, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5666, PETRI_PLACES=321, PETRI_TRANSITIONS=399}
[2024-06-14 16:09:02,034 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places.
[2024-06-14 16:09:02,034 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 399 transitions, 5666 flow
[2024-06-14 16:09:02,034 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-14 16:09:02,035 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:02,035 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-14 16:09:02,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-14 16:09:02,035 INFO  L420      AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:02,035 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:02,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063598945, now seen corresponding path program 4 times
[2024-06-14 16:09:02,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:02,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403523602]
[2024-06-14 16:09:02,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:02,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:02,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:11,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:11,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:11,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403523602]
[2024-06-14 16:09:11,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403523602] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:11,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:11,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:09:11,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310817553]
[2024-06-14 16:09:11,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:11,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:09:11,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:11,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:09:11,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:09:11,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:09:11,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 399 transitions, 5666 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-14 16:09:11,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:11,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:09:11,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:13,974 INFO  L124   PetriNetUnfolderBase]: 4030/6216 cut-off events.
[2024-06-14 16:09:13,974 INFO  L125   PetriNetUnfolderBase]: For 566155/566155 co-relation queries the response was YES.
[2024-06-14 16:09:14,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51589 conditions, 6216 events. 4030/6216 cut-off events. For 566155/566155 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35476 event pairs, 858 based on Foata normal form. 1/6215 useless extension candidates. Maximal degree in co-relation 51430. Up to 6154 conditions per place. 
[2024-06-14 16:09:14,056 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 390 selfloop transitions, 25 changer transitions 0/418 dead transitions.
[2024-06-14 16:09:14,056 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 418 transitions, 6554 flow
[2024-06-14 16:09:14,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:09:14,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:09:14,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-14 16:09:14,057 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 16:09:14,057 INFO  L175             Difference]: Start difference. First operand has 321 places, 399 transitions, 5666 flow. Second operand 7 states and 112 transitions.
[2024-06-14 16:09:14,057 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 418 transitions, 6554 flow
[2024-06-14 16:09:15,394 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 418 transitions, 6313 flow, removed 81 selfloop flow, removed 5 redundant places.
[2024-06-14 16:09:15,399 INFO  L231             Difference]: Finished difference. Result has 323 places, 399 transitions, 5485 flow
[2024-06-14 16:09:15,400 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5425, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5485, PETRI_PLACES=323, PETRI_TRANSITIONS=399}
[2024-06-14 16:09:15,400 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places.
[2024-06-14 16:09:15,400 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 399 transitions, 5485 flow
[2024-06-14 16:09:15,400 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-14 16:09:15,400 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:15,400 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-14 16:09:15,400 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-14 16:09:15,400 INFO  L420      AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:15,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:15,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -1056241560, now seen corresponding path program 5 times
[2024-06-14 16:09:15,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:15,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694456140]
[2024-06-14 16:09:15,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:15,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:15,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:23,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-14 16:09:23,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:23,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694456140]
[2024-06-14 16:09:23,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694456140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:23,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:23,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:09:23,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998767015]
[2024-06-14 16:09:23,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:23,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:09:23,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:23,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:09:23,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:09:23,661 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:09:23,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 399 transitions, 5485 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-14 16:09:23,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:23,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:09:23,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:25,841 INFO  L124   PetriNetUnfolderBase]: 4034/6220 cut-off events.
[2024-06-14 16:09:25,841 INFO  L125   PetriNetUnfolderBase]: For 580354/580383 co-relation queries the response was YES.
[2024-06-14 16:09:25,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51155 conditions, 6220 events. 4034/6220 cut-off events. For 580354/580383 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 35488 event pairs, 828 based on Foata normal form. 26/6242 useless extension candidates. Maximal degree in co-relation 50997. Up to 6129 conditions per place. 
[2024-06-14 16:09:25,949 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 386 selfloop transitions, 28 changer transitions 0/417 dead transitions.
[2024-06-14 16:09:25,949 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 417 transitions, 6491 flow
[2024-06-14 16:09:25,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:09:25,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:09:25,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions.
[2024-06-14 16:09:25,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37282229965156793
[2024-06-14 16:09:25,950 INFO  L175             Difference]: Start difference. First operand has 323 places, 399 transitions, 5485 flow. Second operand 7 states and 107 transitions.
[2024-06-14 16:09:25,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 417 transitions, 6491 flow
[2024-06-14 16:09:27,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 417 transitions, 6421 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 16:09:27,530 INFO  L231             Difference]: Finished difference. Result has 324 places, 403 transitions, 5600 flow
[2024-06-14 16:09:27,530 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5415, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5600, PETRI_PLACES=324, PETRI_TRANSITIONS=403}
[2024-06-14 16:09:27,530 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 282 predicate places.
[2024-06-14 16:09:27,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 324 places, 403 transitions, 5600 flow
[2024-06-14 16:09:27,531 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-14 16:09:27,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:27,531 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-14 16:09:27,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-14 16:09:27,531 INFO  L420      AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:27,531 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:27,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -1055974433, now seen corresponding path program 1 times
[2024-06-14 16:09:27,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:27,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479132501]
[2024-06-14 16:09:27,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:27,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:27,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15