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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 18:07:37,086 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:07:37,128 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:07:37,131 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:07:37,131 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:07:37,152 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:07:37,153 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:07:37,153 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:07:37,154 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:07:37,154 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:07:37,155 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:07:37,155 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:07:37,155 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:07:37,156 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:07:37,156 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:07:37,157 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:07:37,157 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:07:37,157 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:07:37,158 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:07:37,158 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:07:37,158 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:07:37,159 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:07:37,159 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:07:37,159 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:07:37,159 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:07:37,160 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:07:37,160 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:07:37,160 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:07:37,161 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:07:37,161 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:07:37,161 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:07:37,161 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:07:37,162 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:07:37,162 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:07:37,162 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:07:37,162 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:07:37,163 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:07:37,163 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:07:37,163 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:07:37,163 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:07:37,163 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:07:37,164 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:07:37,164 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:07:37,164 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 18:07:37,384 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:07:37,407 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:07:37,409 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:07:37,410 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:07:37,410 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:07:37,412 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:07:38,414 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:07:38,600 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:07:38,601 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:07:38,619 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4221e5b0/d6d22dffbdfc422384a4931aeb42b28b/FLAG0a592a63b
[2024-06-04 18:07:38,630 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4221e5b0/d6d22dffbdfc422384a4931aeb42b28b
[2024-06-04 18:07:38,632 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:07:38,632 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:07:38,633 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-04 18:07:38,831 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:07:38,832 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:07:38,833 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:07:38,833 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:07:38,837 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:07:38,838 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:07:38" (1/2) ...
[2024-06-04 18:07:38,839 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c0df6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:07:38, skipping insertion in model container
[2024-06-04 18:07:38,839 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:07:38" (1/2) ...
[2024-06-04 18:07:38,840 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c34bfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:07:38, skipping insertion in model container
[2024-06-04 18:07:38,840 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:07:38" (2/2) ...
[2024-06-04 18:07:38,841 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c0df6f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:38, skipping insertion in model container
[2024-06-04 18:07:38,841 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:07:38" (2/2) ...
[2024-06-04 18:07:38,841 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:07:38,914 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:07:38,915 INFO  L97    edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-04 18:07:38,916 INFO  L97    edCorrectnessWitness]: Location invariant before [L833-L833] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-04 18:07:38,917 INFO  L97    edCorrectnessWitness]: Location invariant before [L831-L831] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-04 18:07:38,917 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:07:38,917 INFO  L106   edCorrectnessWitness]: ghost_update [L829-L829] multithreaded = 1;
[2024-06-04 18:07:38,954 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:07:39,265 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:07:39,289 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:07:39,588 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:07:39,623 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:07:39,624 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39 WrapperNode
[2024-06-04 18:07:39,624 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:07:39,625 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:07:39,625 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:07:39,625 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:07:39,630 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,664 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,806 INFO  L138                Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124
[2024-06-04 18:07:39,806 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:07:39,807 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:07:39,807 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:07:39,808 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:07:39,856 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,856 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,904 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,951 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 18:07:39,952 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,952 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:39,998 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:40,000 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:40,018 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:40,022 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:40,050 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:07:40,051 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:07:40,051 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:07:40,052 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:07:40,052 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (1/1) ...
[2024-06-04 18:07:40,056 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:07:40,063 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:07:40,076 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 18:07:40,095 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 18:07:40,108 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:07:40,108 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:07:40,108 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:07:40,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:07:40,109 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:07:40,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:07:40,109 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:07:40,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:07:40,109 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:07:40,109 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:07:40,110 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:07:40,110 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:07:40,111 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:07:40,235 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:07:40,237 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:07:41,290 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:07:41,292 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:07:41,548 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:07:41,549 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:07:41,549 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:07:41 BoogieIcfgContainer
[2024-06-04 18:07:41,549 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:07:41,551 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:07:41,552 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:07:41,554 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:07:41,554 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:07:38" (1/4) ...
[2024-06-04 18:07:41,555 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dcd7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:07:41, skipping insertion in model container
[2024-06-04 18:07:41,555 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:07:38" (2/4) ...
[2024-06-04 18:07:41,555 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dcd7fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:07:41, skipping insertion in model container
[2024-06-04 18:07:41,556 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:07:39" (3/4) ...
[2024-06-04 18:07:41,556 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dcd7fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:07:41, skipping insertion in model container
[2024-06-04 18:07:41,556 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:07:41" (4/4) ...
[2024-06-04 18:07:41,557 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:07:41,570 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:07:41,571 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:07:41,571 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:07:41,655 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:07:41,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-04 18:07:41,730 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-04 18:07:41,731 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:07:41,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 18:07:41,734 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-04 18:07:41,737 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-04 18:07:41,748 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:07:41,795 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;@452ebb7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:07:41,796 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:07:41,803 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:07:41,803 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 18:07:41,803 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:07:41,803 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:41,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:41,804 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:41,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:41,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -1490631750, now seen corresponding path program 1 times
[2024-06-04 18:07:41,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:41,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664520181]
[2024-06-04 18:07:41,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:41,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:42,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:46,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:46,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:46,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664520181]
[2024-06-04 18:07:46,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664520181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:46,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:46,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:07:46,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214730800]
[2024-06-04 18:07:46,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:46,631 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:07:46,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:46,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:07:46,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:07:46,744 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-04 18:07:46,746 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:46,746 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:46,746 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-04 18:07:46,747 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:47,403 INFO  L124   PetriNetUnfolderBase]: 1150/1746 cut-off events.
[2024-06-04 18:07:47,403 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-04 18:07:47,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1746 events. 1150/1746 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7851 event pairs, 805 based on Foata normal form. 3/1712 useless extension candidates. Maximal degree in co-relation 3552. Up to 1726 conditions per place. 
[2024-06-04 18:07:47,415 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 35 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 18:07:47,415 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow
[2024-06-04 18:07:47,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:07:47,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:07:47,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2024-06-04 18:07:47,424 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-04 18:07:47,425 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 72 transitions.
[2024-06-04 18:07:47,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow
[2024-06-04 18:07:47,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:07:47,429 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-04 18:07:47,431 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-04 18:07:47,433 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-04 18:07:47,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-04 18:07:47,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:47,433 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:47,434 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:47,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:07:47,434 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:47,434 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:47,435 INFO  L85        PathProgramCache]: Analyzing trace with hash 2021986201, now seen corresponding path program 1 times
[2024-06-04 18:07:47,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:47,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156333917]
[2024-06-04 18:07:47,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:47,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:47,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:50,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:50,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:50,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156333917]
[2024-06-04 18:07:50,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156333917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:50,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:50,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:07:50,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050097342]
[2024-06-04 18:07:50,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:50,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:07:50,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:50,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:07:50,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:07:51,033 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-04 18:07:51,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:51,033 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:51,033 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-04 18:07:51,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:51,678 INFO  L124   PetriNetUnfolderBase]: 1154/1751 cut-off events.
[2024-06-04 18:07:51,679 INFO  L125   PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES.
[2024-06-04 18:07:51,681 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1751 events. 1154/1751 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7935 event pairs, 630 based on Foata normal form. 5/1754 useless extension candidates. Maximal degree in co-relation 4060. Up to 1716 conditions per place. 
[2024-06-04 18:07:51,687 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 45 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-04 18:07:51,687 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 264 flow
[2024-06-04 18:07:51,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:07:51,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:07:51,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-04 18:07:51,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.575
[2024-06-04 18:07:51,689 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 92 transitions.
[2024-06-04 18:07:51,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 264 flow
[2024-06-04 18:07:51,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:07:51,690 INFO  L231             Difference]: Finished difference. Result has 45 places, 40 transitions, 154 flow
[2024-06-04 18:07:51,691 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=40}
[2024-06-04 18:07:51,691 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2024-06-04 18:07:51,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 154 flow
[2024-06-04 18:07:51,692 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:51,692 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:51,692 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:51,692 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:07:51,692 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:51,693 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:51,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -1742936489, now seen corresponding path program 1 times
[2024-06-04 18:07:51,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:51,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438830319]
[2024-06-04 18:07:51,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:51,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:51,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:55,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:55,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:55,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438830319]
[2024-06-04 18:07:55,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438830319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:55,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:55,100 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 18:07:55,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333945854]
[2024-06-04 18:07:55,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:55,101 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 18:07:55,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:55,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 18:07:55,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 18:07:55,202 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-04 18:07:55,202 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 154 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-04 18:07:55,202 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:55,202 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-04 18:07:55,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:56,069 INFO  L124   PetriNetUnfolderBase]: 1409/2119 cut-off events.
[2024-06-04 18:07:56,069 INFO  L125   PetriNetUnfolderBase]: For 1023/1023 co-relation queries the response was YES.
[2024-06-04 18:07:56,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 2119 events. 1409/2119 cut-off events. For 1023/1023 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9371 event pairs, 626 based on Foata normal form. 7/2125 useless extension candidates. Maximal degree in co-relation 5529. Up to 1980 conditions per place. 
[2024-06-04 18:07:56,080 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 65 selfloop transitions, 14 changer transitions 0/82 dead transitions.
[2024-06-04 18:07:56,080 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 451 flow
[2024-06-04 18:07:56,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:07:56,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:07:56,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions.
[2024-06-04 18:07:56,085 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.58
[2024-06-04 18:07:56,085 INFO  L175             Difference]: Start difference. First operand has 45 places, 40 transitions, 154 flow. Second operand 5 states and 116 transitions.
[2024-06-04 18:07:56,085 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 451 flow
[2024-06-04 18:07:56,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 436 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-06-04 18:07:56,089 INFO  L231             Difference]: Finished difference. Result has 51 places, 53 transitions, 257 flow
[2024-06-04 18:07:56,090 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=51, PETRI_TRANSITIONS=53}
[2024-06-04 18:07:56,090 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places.
[2024-06-04 18:07:56,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 257 flow
[2024-06-04 18:07:56,091 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-04 18:07:56,091 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:56,091 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:56,091 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:07:56,091 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:56,092 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:56,092 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803544440, now seen corresponding path program 1 times
[2024-06-04 18:07:56,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:56,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247569704]
[2024-06-04 18:07:56,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:56,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:56,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:59,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:59,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:59,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247569704]
[2024-06-04 18:07:59,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247569704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:59,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:59,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:07:59,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536350392]
[2024-06-04 18:07:59,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:59,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:07:59,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:59,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:07:59,866 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:07:59,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-04 18:07:59,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 257 flow. Second operand  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:59,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:59,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-04 18:07:59,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:01,015 INFO  L124   PetriNetUnfolderBase]: 1431/2152 cut-off events.
[2024-06-04 18:08:01,016 INFO  L125   PetriNetUnfolderBase]: For 2498/2500 co-relation queries the response was YES.
[2024-06-04 18:08:01,018 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6768 conditions, 2152 events. 1431/2152 cut-off events. For 2498/2500 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9608 event pairs, 502 based on Foata normal form. 9/2160 useless extension candidates. Maximal degree in co-relation 6746. Up to 1969 conditions per place. 
[2024-06-04 18:08:01,025 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 73 selfloop transitions, 18 changer transitions 0/94 dead transitions.
[2024-06-04 18:08:01,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 583 flow
[2024-06-04 18:08:01,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:01,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:01,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-06-04 18:08:01,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5708333333333333
[2024-06-04 18:08:01,027 INFO  L175             Difference]: Start difference. First operand has 51 places, 53 transitions, 257 flow. Second operand 6 states and 137 transitions.
[2024-06-04 18:08:01,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 583 flow
[2024-06-04 18:08:01,035 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 579 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-04 18:08:01,037 INFO  L231             Difference]: Finished difference. Result has 57 places, 57 transitions, 326 flow
[2024-06-04 18:08:01,037 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=57, PETRI_TRANSITIONS=57}
[2024-06-04 18:08:01,038 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places.
[2024-06-04 18:08:01,038 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 326 flow
[2024-06-04 18:08:01,039 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:01,039 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:01,039 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:01,039 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:08:01,039 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:01,039 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:01,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 75303574, now seen corresponding path program 1 times
[2024-06-04 18:08:01,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:01,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576353953]
[2024-06-04 18:08:01,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:01,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:01,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:05,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:05,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:05,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576353953]
[2024-06-04 18:08:05,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576353953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:05,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:05,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:08:05,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683879872]
[2024-06-04 18:08:05,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:05,643 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:08:05,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:05,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:08:05,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:08:05,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-04 18:08:05,770 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 326 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-04 18:08:05,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:05,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-04 18:08:05,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:07,010 INFO  L124   PetriNetUnfolderBase]: 1527/2320 cut-off events.
[2024-06-04 18:08:07,011 INFO  L125   PetriNetUnfolderBase]: For 4091/4095 co-relation queries the response was YES.
[2024-06-04 18:08:07,016 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8034 conditions, 2320 events. 1527/2320 cut-off events. For 4091/4095 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10720 event pairs, 307 based on Foata normal form. 28/2347 useless extension candidates. Maximal degree in co-relation 8009. Up to 1890 conditions per place. 
[2024-06-04 18:08:07,025 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 84 selfloop transitions, 31 changer transitions 0/118 dead transitions.
[2024-06-04 18:08:07,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 812 flow
[2024-06-04 18:08:07,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:08:07,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:08:07,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions.
[2024-06-04 18:08:07,028 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.575
[2024-06-04 18:08:07,028 INFO  L175             Difference]: Start difference. First operand has 57 places, 57 transitions, 326 flow. Second operand 7 states and 161 transitions.
[2024-06-04 18:08:07,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 812 flow
[2024-06-04 18:08:07,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 118 transitions, 771 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:07,037 INFO  L231             Difference]: Finished difference. Result has 63 places, 71 transitions, 495 flow
[2024-06-04 18:08:07,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=63, PETRI_TRANSITIONS=71}
[2024-06-04 18:08:07,040 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places.
[2024-06-04 18:08:07,040 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 71 transitions, 495 flow
[2024-06-04 18:08:07,040 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-04 18:08:07,045 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:07,045 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:07,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:08:07,046 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:07,046 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:07,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -166536493, now seen corresponding path program 1 times
[2024-06-04 18:08:07,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:07,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499732013]
[2024-06-04 18:08:07,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:07,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:07,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:15,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-04 18:08:15,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:15,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499732013]
[2024-06-04 18:08:15,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499732013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:15,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:15,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:08:15,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068736323]
[2024-06-04 18:08:15,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:15,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:08:15,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:15,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:08:15,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:08:16,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:16,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 71 transitions, 495 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-04 18:08:16,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:16,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:16,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:16,918 INFO  L124   PetriNetUnfolderBase]: 1517/2304 cut-off events.
[2024-06-04 18:08:16,918 INFO  L125   PetriNetUnfolderBase]: For 7384/7384 co-relation queries the response was YES.
[2024-06-04 18:08:16,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 2304 events. 1517/2304 cut-off events. For 7384/7384 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10549 event pairs, 534 based on Foata normal form. 4/2307 useless extension candidates. Maximal degree in co-relation 9319. Up to 2273 conditions per place. 
[2024-06-04 18:08:16,932 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 71 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2024-06-04 18:08:16,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 699 flow
[2024-06-04 18:08:16,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:08:16,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:08:16,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions.
[2024-06-04 18:08:16,934 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.435
[2024-06-04 18:08:16,934 INFO  L175             Difference]: Start difference. First operand has 63 places, 71 transitions, 495 flow. Second operand 5 states and 87 transitions.
[2024-06-04 18:08:16,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 699 flow
[2024-06-04 18:08:16,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 681 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-06-04 18:08:16,944 INFO  L231             Difference]: Finished difference. Result has 69 places, 73 transitions, 527 flow
[2024-06-04 18:08:16,944 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=69, PETRI_TRANSITIONS=73}
[2024-06-04 18:08:16,947 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places.
[2024-06-04 18:08:16,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 527 flow
[2024-06-04 18:08:16,947 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-04 18:08:16,947 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:16,947 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:16,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:08:16,948 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:16,948 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:16,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -1134207834, now seen corresponding path program 1 times
[2024-06-04 18:08:16,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:16,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8404799]
[2024-06-04 18:08:16,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:16,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:16,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:24,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:24,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:24,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8404799]
[2024-06-04 18:08:24,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8404799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:24,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:24,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:08:24,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025476270]
[2024-06-04 18:08:24,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:24,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:08:24,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:24,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:08:24,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:08:24,327 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:24,328 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 527 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-04 18:08:24,328 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:24,328 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:24,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:25,149 INFO  L124   PetriNetUnfolderBase]: 1529/2323 cut-off events.
[2024-06-04 18:08:25,149 INFO  L125   PetriNetUnfolderBase]: For 8640/8642 co-relation queries the response was YES.
[2024-06-04 18:08:25,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9593 conditions, 2323 events. 1529/2323 cut-off events. For 8640/8642 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10686 event pairs, 466 based on Foata normal form. 10/2332 useless extension candidates. Maximal degree in co-relation 9558. Up to 2171 conditions per place. 
[2024-06-04 18:08:25,163 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 78 selfloop transitions, 18 changer transitions 0/99 dead transitions.
[2024-06-04 18:08:25,163 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 837 flow
[2024-06-04 18:08:25,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:25,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:25,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-04 18:08:25,164 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-04 18:08:25,164 INFO  L175             Difference]: Start difference. First operand has 69 places, 73 transitions, 527 flow. Second operand 6 states and 112 transitions.
[2024-06-04 18:08:25,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 837 flow
[2024-06-04 18:08:25,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 99 transitions, 815 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-06-04 18:08:25,173 INFO  L231             Difference]: Finished difference. Result has 73 places, 77 transitions, 597 flow
[2024-06-04 18:08:25,173 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=597, PETRI_PLACES=73, PETRI_TRANSITIONS=77}
[2024-06-04 18:08:25,173 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places.
[2024-06-04 18:08:25,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 597 flow
[2024-06-04 18:08:25,173 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-04 18:08:25,174 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:25,174 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:25,174 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:08:25,174 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:25,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:25,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 446072524, now seen corresponding path program 2 times
[2024-06-04 18:08:25,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:25,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444083902]
[2024-06-04 18:08:25,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:25,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:25,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:31,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:31,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:31,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444083902]
[2024-06-04 18:08:31,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444083902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:31,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:31,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:08:31,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595535659]
[2024-06-04 18:08:31,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:31,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:08:31,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:31,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:08:31,866 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:08:32,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:32,009 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 597 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-04 18:08:32,009 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:32,009 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:32,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:32,761 INFO  L124   PetriNetUnfolderBase]: 1503/2280 cut-off events.
[2024-06-04 18:08:32,761 INFO  L125   PetriNetUnfolderBase]: For 10118/10118 co-relation queries the response was YES.
[2024-06-04 18:08:32,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9731 conditions, 2280 events. 1503/2280 cut-off events. For 10118/10118 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10340 event pairs, 508 based on Foata normal form. 4/2283 useless extension candidates. Maximal degree in co-relation 9694. Up to 2240 conditions per place. 
[2024-06-04 18:08:32,779 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 80 selfloop transitions, 11 changer transitions 0/94 dead transitions.
[2024-06-04 18:08:32,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 94 transitions, 832 flow
[2024-06-04 18:08:32,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:32,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:32,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-04 18:08:32,783 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:08:32,784 INFO  L175             Difference]: Start difference. First operand has 73 places, 77 transitions, 597 flow. Second operand 6 states and 102 transitions.
[2024-06-04 18:08:32,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 94 transitions, 832 flow
[2024-06-04 18:08:32,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 809 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-06-04 18:08:32,803 INFO  L231             Difference]: Finished difference. Result has 76 places, 78 transitions, 617 flow
[2024-06-04 18:08:32,804 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=76, PETRI_TRANSITIONS=78}
[2024-06-04 18:08:32,806 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places.
[2024-06-04 18:08:32,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 617 flow
[2024-06-04 18:08:32,806 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-04 18:08:32,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:32,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:32,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:08:32,806 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:32,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:32,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -1146504728, now seen corresponding path program 1 times
[2024-06-04 18:08:32,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:32,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873746342]
[2024-06-04 18:08:32,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:32,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:32,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:42,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:42,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:42,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873746342]
[2024-06-04 18:08:42,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873746342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:42,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:42,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:08:42,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307107342]
[2024-06-04 18:08:42,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:42,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:08:42,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:42,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:08:42,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:08:42,128 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:42,129 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 617 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-04 18:08:42,129 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:42,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:42,129 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:43,028 INFO  L124   PetriNetUnfolderBase]: 1495/2268 cut-off events.
[2024-06-04 18:08:43,029 INFO  L125   PetriNetUnfolderBase]: For 11621/11621 co-relation queries the response was YES.
[2024-06-04 18:08:43,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9820 conditions, 2268 events. 1495/2268 cut-off events. For 11621/11621 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10257 event pairs, 489 based on Foata normal form. 4/2271 useless extension candidates. Maximal degree in co-relation 9782. Up to 2219 conditions per place. 
[2024-06-04 18:08:43,039 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 81 selfloop transitions, 12 changer transitions 0/96 dead transitions.
[2024-06-04 18:08:43,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 859 flow
[2024-06-04 18:08:43,040 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:43,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:43,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-04 18:08:43,041 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:08:43,041 INFO  L175             Difference]: Start difference. First operand has 76 places, 78 transitions, 617 flow. Second operand 6 states and 102 transitions.
[2024-06-04 18:08:43,041 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 859 flow
[2024-06-04 18:08:43,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 96 transitions, 835 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:43,050 INFO  L231             Difference]: Finished difference. Result has 78 places, 80 transitions, 644 flow
[2024-06-04 18:08:43,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=78, PETRI_TRANSITIONS=80}
[2024-06-04 18:08:43,051 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places.
[2024-06-04 18:08:43,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 644 flow
[2024-06-04 18:08:43,051 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-04 18:08:43,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:43,051 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:43,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:08:43,052 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:43,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:43,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1179537126, now seen corresponding path program 1 times
[2024-06-04 18:08:43,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:43,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253487154]
[2024-06-04 18:08:43,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:43,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:43,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:49,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:49,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:49,762 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253487154]
[2024-06-04 18:08:49,762 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253487154] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:49,762 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:49,762 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:08:49,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123155893]
[2024-06-04 18:08:49,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:49,763 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:08:49,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:49,763 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:08:49,763 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:08:49,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:49,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 644 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-04 18:08:49,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:49,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:49,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:50,730 INFO  L124   PetriNetUnfolderBase]: 1490/2261 cut-off events.
[2024-06-04 18:08:50,731 INFO  L125   PetriNetUnfolderBase]: For 13110/13110 co-relation queries the response was YES.
[2024-06-04 18:08:50,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10068 conditions, 2261 events. 1490/2261 cut-off events. For 13110/13110 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10257 event pairs, 502 based on Foata normal form. 2/2262 useless extension candidates. Maximal degree in co-relation 10030. Up to 2203 conditions per place. 
[2024-06-04 18:08:50,759 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 77 selfloop transitions, 16 changer transitions 0/96 dead transitions.
[2024-06-04 18:08:50,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 96 transitions, 872 flow
[2024-06-04 18:08:50,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:50,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:50,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-04 18:08:50,765 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42916666666666664
[2024-06-04 18:08:50,765 INFO  L175             Difference]: Start difference. First operand has 78 places, 80 transitions, 644 flow. Second operand 6 states and 103 transitions.
[2024-06-04 18:08:50,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 96 transitions, 872 flow
[2024-06-04 18:08:50,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 96 transitions, 835 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:50,778 INFO  L231             Difference]: Finished difference. Result has 80 places, 80 transitions, 651 flow
[2024-06-04 18:08:50,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=651, PETRI_PLACES=80, PETRI_TRANSITIONS=80}
[2024-06-04 18:08:50,778 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-04 18:08:50,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 651 flow
[2024-06-04 18:08:50,779 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-04 18:08:50,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:50,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:50,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:08:50,779 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:50,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:50,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 1808512779, now seen corresponding path program 1 times
[2024-06-04 18:08:50,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:50,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350149120]
[2024-06-04 18:08:50,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:50,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:50,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:59,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:59,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:59,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350149120]
[2024-06-04 18:08:59,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350149120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:59,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:59,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:08:59,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582322520]
[2024-06-04 18:08:59,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:59,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:08:59,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:59,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:08:59,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:08:59,381 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:59,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 651 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:59,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:59,381 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:59,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:00,215 INFO  L124   PetriNetUnfolderBase]: 1512/2295 cut-off events.
[2024-06-04 18:09:00,216 INFO  L125   PetriNetUnfolderBase]: For 15198/15204 co-relation queries the response was YES.
[2024-06-04 18:09:00,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10379 conditions, 2295 events. 1512/2295 cut-off events. For 15198/15204 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10473 event pairs, 429 based on Foata normal form. 8/2302 useless extension candidates. Maximal degree in co-relation 10340. Up to 2029 conditions per place. 
[2024-06-04 18:09:00,227 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 79 selfloop transitions, 36 changer transitions 0/118 dead transitions.
[2024-06-04 18:09:00,227 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 1101 flow
[2024-06-04 18:09:00,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:09:00,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:09:00,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-04 18:09:00,230 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4785714285714286
[2024-06-04 18:09:00,230 INFO  L175             Difference]: Start difference. First operand has 80 places, 80 transitions, 651 flow. Second operand 7 states and 134 transitions.
[2024-06-04 18:09:00,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 1101 flow
[2024-06-04 18:09:00,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 118 transitions, 1059 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-04 18:09:00,241 INFO  L231             Difference]: Finished difference. Result has 82 places, 86 transitions, 743 flow
[2024-06-04 18:09:00,241 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=743, PETRI_PLACES=82, PETRI_TRANSITIONS=86}
[2024-06-04 18:09:00,241 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places.
[2024-06-04 18:09:00,241 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 743 flow
[2024-06-04 18:09:00,242 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:00,242 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:00,242 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:00,242 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:09:00,242 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:00,242 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:00,243 INFO  L85        PathProgramCache]: Analyzing trace with hash 881869649, now seen corresponding path program 2 times
[2024-06-04 18:09:00,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:00,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898305232]
[2024-06-04 18:09:00,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:00,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:00,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:07,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:07,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:07,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898305232]
[2024-06-04 18:09:07,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898305232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:07,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:07,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:09:07,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410167611]
[2024-06-04 18:09:07,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:07,932 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:09:07,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:07,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:09:07,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:09:08,112 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:09:08,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 743 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:08,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:08,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:09:08,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:08,936 INFO  L124   PetriNetUnfolderBase]: 1502/2280 cut-off events.
[2024-06-04 18:09:08,937 INFO  L125   PetriNetUnfolderBase]: For 17556/17558 co-relation queries the response was YES.
[2024-06-04 18:09:08,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10854 conditions, 2280 events. 1502/2280 cut-off events. For 17556/17558 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10399 event pairs, 435 based on Foata normal form. 6/2285 useless extension candidates. Maximal degree in co-relation 10814. Up to 2117 conditions per place. 
[2024-06-04 18:09:08,948 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 86 selfloop transitions, 22 changer transitions 0/111 dead transitions.
[2024-06-04 18:09:08,949 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 1027 flow
[2024-06-04 18:09:08,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:09:08,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:09:08,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 18:09:08,951 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:09:08,951 INFO  L175             Difference]: Start difference. First operand has 82 places, 86 transitions, 743 flow. Second operand 7 states and 126 transitions.
[2024-06-04 18:09:08,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 1027 flow
[2024-06-04 18:09:08,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 976 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-04 18:09:08,967 INFO  L231             Difference]: Finished difference. Result has 86 places, 86 transitions, 744 flow
[2024-06-04 18:09:08,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=744, PETRI_PLACES=86, PETRI_TRANSITIONS=86}
[2024-06-04 18:09:08,968 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places.
[2024-06-04 18:09:08,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 744 flow
[2024-06-04 18:09:08,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:08,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:08,968 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:08,968 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:09:08,968 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:08,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:08,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 885594671, now seen corresponding path program 1 times
[2024-06-04 18:09:08,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:08,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212809676]
[2024-06-04 18:09:08,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:08,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:09,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:16,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:16,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:16,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212809676]
[2024-06-04 18:09:16,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212809676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:16,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:16,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:09:16,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162917678]
[2024-06-04 18:09:16,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:16,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:09:16,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:16,470 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:09:16,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:09:16,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:09:16,596 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 744 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:16,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:16,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:09:16,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:17,536 INFO  L124   PetriNetUnfolderBase]: 1536/2334 cut-off events.
[2024-06-04 18:09:17,537 INFO  L125   PetriNetUnfolderBase]: For 20279/20281 co-relation queries the response was YES.
[2024-06-04 18:09:17,541 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11304 conditions, 2334 events. 1536/2334 cut-off events. For 20279/20281 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10754 event pairs, 427 based on Foata normal form. 10/2343 useless extension candidates. Maximal degree in co-relation 11262. Up to 2158 conditions per place. 
[2024-06-04 18:09:17,546 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 89 selfloop transitions, 22 changer transitions 0/114 dead transitions.
[2024-06-04 18:09:17,547 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 1058 flow
[2024-06-04 18:09:17,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:09:17,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:09:17,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 18:09:17,550 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:09:17,550 INFO  L175             Difference]: Start difference. First operand has 86 places, 86 transitions, 744 flow. Second operand 7 states and 126 transitions.
[2024-06-04 18:09:17,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 1058 flow
[2024-06-04 18:09:17,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 114 transitions, 993 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 18:09:17,563 INFO  L231             Difference]: Finished difference. Result has 87 places, 89 transitions, 763 flow
[2024-06-04 18:09:17,564 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=763, PETRI_PLACES=87, PETRI_TRANSITIONS=89}
[2024-06-04 18:09:17,565 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places.
[2024-06-04 18:09:17,565 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 763 flow
[2024-06-04 18:09:17,565 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:17,565 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:17,566 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:17,566 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:09:17,566 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:17,566 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:17,566 INFO  L85        PathProgramCache]: Analyzing trace with hash -1423151526, now seen corresponding path program 1 times
[2024-06-04 18:09:17,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:17,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142629]
[2024-06-04 18:09:17,567 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:17,567 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:17,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:24,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:24,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:24,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142629]
[2024-06-04 18:09:24,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:24,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:24,811 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:09:24,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290687661]
[2024-06-04 18:09:24,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:24,812 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:09:24,812 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:24,812 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:09:24,812 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:09:25,007 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:09:25,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 763 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:25,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:25,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:09:25,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:25,815 INFO  L124   PetriNetUnfolderBase]: 1516/2295 cut-off events.
[2024-06-04 18:09:25,816 INFO  L125   PetriNetUnfolderBase]: For 22284/22289 co-relation queries the response was YES.
[2024-06-04 18:09:25,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 2295 events. 1516/2295 cut-off events. For 22284/22289 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10410 event pairs, 431 based on Foata normal form. 6/2300 useless extension candidates. Maximal degree in co-relation 11437. Up to 2127 conditions per place. 
[2024-06-04 18:09:25,825 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 81 selfloop transitions, 28 changer transitions 0/112 dead transitions.
[2024-06-04 18:09:25,825 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 1043 flow
[2024-06-04 18:09:25,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:09:25,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:09:25,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-04 18:09:25,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-04 18:09:25,828 INFO  L175             Difference]: Start difference. First operand has 87 places, 89 transitions, 763 flow. Second operand 6 states and 114 transitions.
[2024-06-04 18:09:25,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 1043 flow
[2024-06-04 18:09:25,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 979 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 18:09:25,843 INFO  L231             Difference]: Finished difference. Result has 88 places, 89 transitions, 770 flow
[2024-06-04 18:09:25,843 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=88, PETRI_TRANSITIONS=89}
[2024-06-04 18:09:25,844 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places.
[2024-06-04 18:09:25,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 770 flow
[2024-06-04 18:09:25,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:25,844 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:25,844 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:25,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:09:25,844 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:25,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:25,845 INFO  L85        PathProgramCache]: Analyzing trace with hash -1423151309, now seen corresponding path program 2 times
[2024-06-04 18:09:25,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:25,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624580392]
[2024-06-04 18:09:25,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:25,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:25,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:33,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-04 18:09:33,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:33,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624580392]
[2024-06-04 18:09:33,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624580392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:33,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:33,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:09:33,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275496724]
[2024-06-04 18:09:33,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:33,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:09:33,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:33,336 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:09:33,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:09:33,506 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:09:33,507 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 770 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-04 18:09:33,507 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:33,507 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:09:33,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:34,439 INFO  L124   PetriNetUnfolderBase]: 1533/2320 cut-off events.
[2024-06-04 18:09:34,439 INFO  L125   PetriNetUnfolderBase]: For 25267/25267 co-relation queries the response was YES.
[2024-06-04 18:09:34,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11750 conditions, 2320 events. 1533/2320 cut-off events. For 25267/25267 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10473 event pairs, 483 based on Foata normal form. 4/2323 useless extension candidates. Maximal degree in co-relation 11706. Up to 2239 conditions per place. 
[2024-06-04 18:09:34,470 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 91 selfloop transitions, 18 changer transitions 0/112 dead transitions.
[2024-06-04 18:09:34,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 112 transitions, 1066 flow
[2024-06-04 18:09:34,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:09:34,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:09:34,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-04 18:09:34,473 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-04 18:09:34,474 INFO  L175             Difference]: Start difference. First operand has 88 places, 89 transitions, 770 flow. Second operand 7 states and 118 transitions.
[2024-06-04 18:09:34,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 112 transitions, 1066 flow
[2024-06-04 18:09:34,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 112 transitions, 1010 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-04 18:09:34,493 INFO  L231             Difference]: Finished difference. Result has 90 places, 91 transitions, 786 flow
[2024-06-04 18:09:34,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=786, PETRI_PLACES=90, PETRI_TRANSITIONS=91}
[2024-06-04 18:09:34,495 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2024-06-04 18:09:34,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 786 flow
[2024-06-04 18:09:34,495 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-04 18:09:34,497 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:34,498 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:34,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:09:34,498 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:34,498 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:34,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 2089323055, now seen corresponding path program 3 times
[2024-06-04 18:09:34,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:34,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158184272]
[2024-06-04 18:09:34,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:34,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:34,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:41,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:41,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:41,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158184272]
[2024-06-04 18:09:41,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158184272] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:41,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:41,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:09:41,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785754575]
[2024-06-04 18:09:41,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:41,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:09:41,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:41,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:09:41,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:09:42,131 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:09:42,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 786 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-04 18:09:42,132 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:42,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:09:42,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:43,212 INFO  L124   PetriNetUnfolderBase]: 1525/2308 cut-off events.
[2024-06-04 18:09:43,212 INFO  L125   PetriNetUnfolderBase]: For 27656/27656 co-relation queries the response was YES.
[2024-06-04 18:09:43,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11870 conditions, 2308 events. 1525/2308 cut-off events. For 27656/27656 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10423 event pairs, 461 based on Foata normal form. 4/2311 useless extension candidates. Maximal degree in co-relation 11825. Up to 2236 conditions per place. 
[2024-06-04 18:09:43,229 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 97 selfloop transitions, 14 changer transitions 0/114 dead transitions.
[2024-06-04 18:09:43,230 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 1088 flow
[2024-06-04 18:09:43,231 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:09:43,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:09:43,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:09:43,232 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-04 18:09:43,232 INFO  L175             Difference]: Start difference. First operand has 90 places, 91 transitions, 786 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:09:43,233 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 1088 flow
[2024-06-04 18:09:43,254 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 114 transitions, 1036 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-04 18:09:43,255 INFO  L231             Difference]: Finished difference. Result has 92 places, 93 transitions, 801 flow
[2024-06-04 18:09:43,256 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=801, PETRI_PLACES=92, PETRI_TRANSITIONS=93}
[2024-06-04 18:09:43,256 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places.
[2024-06-04 18:09:43,256 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 801 flow
[2024-06-04 18:09:43,257 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-04 18:09:43,257 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:43,261 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:43,261 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:09:43,261 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:43,262 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:43,262 INFO  L85        PathProgramCache]: Analyzing trace with hash 1565299615, now seen corresponding path program 1 times
[2024-06-04 18:09:43,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:43,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858019053]
[2024-06-04 18:09:43,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:43,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:43,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:52,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:52,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:52,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858019053]
[2024-06-04 18:09:52,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858019053] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:52,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:52,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:09:52,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742833755]
[2024-06-04 18:09:52,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:52,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:09:52,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:52,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:09:52,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:09:52,603 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:09:52,604 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 801 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:52,604 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:52,604 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:09:52,604 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:53,653 INFO  L124   PetriNetUnfolderBase]: 1644/2511 cut-off events.
[2024-06-04 18:09:53,653 INFO  L125   PetriNetUnfolderBase]: For 35331/35336 co-relation queries the response was YES.
[2024-06-04 18:09:53,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13092 conditions, 2511 events. 1644/2511 cut-off events. For 35331/35336 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11786 event pairs, 288 based on Foata normal form. 20/2530 useless extension candidates. Maximal degree in co-relation 13046. Up to 1822 conditions per place. 
[2024-06-04 18:09:53,667 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 95 selfloop transitions, 39 changer transitions 0/137 dead transitions.
[2024-06-04 18:09:53,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 137 transitions, 1303 flow
[2024-06-04 18:09:53,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:09:53,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:09:53,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 18:09:53,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-04 18:09:53,672 INFO  L175             Difference]: Start difference. First operand has 92 places, 93 transitions, 801 flow. Second operand 8 states and 152 transitions.
[2024-06-04 18:09:53,672 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 137 transitions, 1303 flow
[2024-06-04 18:09:53,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 1254 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 18:09:53,693 INFO  L231             Difference]: Finished difference. Result has 95 places, 95 transitions, 874 flow
[2024-06-04 18:09:53,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=874, PETRI_PLACES=95, PETRI_TRANSITIONS=95}
[2024-06-04 18:09:53,694 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places.
[2024-06-04 18:09:53,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 874 flow
[2024-06-04 18:09:53,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:53,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:53,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:53,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:09:53,695 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:53,695 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:53,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -747575163, now seen corresponding path program 2 times
[2024-06-04 18:09:53,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:53,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67010778]
[2024-06-04 18:09:53,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:53,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:53,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:01,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:01,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:01,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67010778]
[2024-06-04 18:10:01,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67010778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:01,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:01,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:01,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311757225]
[2024-06-04 18:10:01,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:01,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:01,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:01,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:01,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:02,105 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:02,105 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 874 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:02,105 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:02,105 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:02,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:03,149 INFO  L124   PetriNetUnfolderBase]: 1719/2636 cut-off events.
[2024-06-04 18:10:03,149 INFO  L125   PetriNetUnfolderBase]: For 40440/40445 co-relation queries the response was YES.
[2024-06-04 18:10:03,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13990 conditions, 2636 events. 1719/2636 cut-off events. For 40440/40445 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12602 event pairs, 457 based on Foata normal form. 24/2659 useless extension candidates. Maximal degree in co-relation 13943. Up to 2260 conditions per place. 
[2024-06-04 18:10:03,165 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 93 selfloop transitions, 37 changer transitions 0/133 dead transitions.
[2024-06-04 18:10:03,165 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 133 transitions, 1266 flow
[2024-06-04 18:10:03,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:03,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:03,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-04 18:10:03,168 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625
[2024-06-04 18:10:03,168 INFO  L175             Difference]: Start difference. First operand has 95 places, 95 transitions, 874 flow. Second operand 8 states and 148 transitions.
[2024-06-04 18:10:03,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 133 transitions, 1266 flow
[2024-06-04 18:10:03,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 133 transitions, 1216 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-04 18:10:03,195 INFO  L231             Difference]: Finished difference. Result has 99 places, 96 transitions, 927 flow
[2024-06-04 18:10:03,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=927, PETRI_PLACES=99, PETRI_TRANSITIONS=96}
[2024-06-04 18:10:03,196 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places.
[2024-06-04 18:10:03,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 927 flow
[2024-06-04 18:10:03,196 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:03,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:03,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:03,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:10:03,197 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:03,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:03,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -744778653, now seen corresponding path program 3 times
[2024-06-04 18:10:03,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:03,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252517068]
[2024-06-04 18:10:03,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:03,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:03,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:12,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:12,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:12,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252517068]
[2024-06-04 18:10:12,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252517068] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:12,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:12,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:12,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906527324]
[2024-06-04 18:10:12,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:12,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:12,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:12,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:12,263 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:12,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:12,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 927 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:12,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:12,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:12,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:13,481 INFO  L124   PetriNetUnfolderBase]: 1695/2600 cut-off events.
[2024-06-04 18:10:13,481 INFO  L125   PetriNetUnfolderBase]: For 40734/40739 co-relation queries the response was YES.
[2024-06-04 18:10:13,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13937 conditions, 2600 events. 1695/2600 cut-off events. For 40734/40739 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12370 event pairs, 464 based on Foata normal form. 16/2615 useless extension candidates. Maximal degree in co-relation 13888. Up to 2345 conditions per place. 
[2024-06-04 18:10:13,497 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 96 selfloop transitions, 32 changer transitions 0/131 dead transitions.
[2024-06-04 18:10:13,498 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 131 transitions, 1309 flow
[2024-06-04 18:10:13,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:13,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:13,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-04 18:10:13,500 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453125
[2024-06-04 18:10:13,501 INFO  L175             Difference]: Start difference. First operand has 99 places, 96 transitions, 927 flow. Second operand 8 states and 145 transitions.
[2024-06-04 18:10:13,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 131 transitions, 1309 flow
[2024-06-04 18:10:13,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 131 transitions, 1230 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:13,529 INFO  L231             Difference]: Finished difference. Result has 101 places, 99 transitions, 967 flow
[2024-06-04 18:10:13,529 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=967, PETRI_PLACES=101, PETRI_TRANSITIONS=99}
[2024-06-04 18:10:13,530 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places.
[2024-06-04 18:10:13,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 967 flow
[2024-06-04 18:10:13,530 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:13,530 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:13,530 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:13,530 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:10:13,531 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:13,531 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:13,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -629309543, now seen corresponding path program 1 times
[2024-06-04 18:10:13,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:13,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116445193]
[2024-06-04 18:10:13,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:13,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:13,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:21,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:21,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:21,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116445193]
[2024-06-04 18:10:21,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116445193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:21,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:21,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:10:21,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454907277]
[2024-06-04 18:10:21,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:21,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:10:21,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:21,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:10:21,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:10:21,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:21,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 967 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:21,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:21,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:21,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:22,685 INFO  L124   PetriNetUnfolderBase]: 1712/2626 cut-off events.
[2024-06-04 18:10:22,685 INFO  L125   PetriNetUnfolderBase]: For 42877/42879 co-relation queries the response was YES.
[2024-06-04 18:10:22,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14396 conditions, 2626 events. 1712/2626 cut-off events. For 42877/42879 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12531 event pairs, 470 based on Foata normal form. 6/2631 useless extension candidates. Maximal degree in co-relation 14346. Up to 2468 conditions per place. 
[2024-06-04 18:10:22,701 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 104 selfloop transitions, 22 changer transitions 0/129 dead transitions.
[2024-06-04 18:10:22,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 129 transitions, 1321 flow
[2024-06-04 18:10:22,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:22,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:22,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-04 18:10:22,704 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-04 18:10:22,704 INFO  L175             Difference]: Start difference. First operand has 101 places, 99 transitions, 967 flow. Second operand 7 states and 128 transitions.
[2024-06-04 18:10:22,704 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 129 transitions, 1321 flow
[2024-06-04 18:10:22,737 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 129 transitions, 1230 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:22,738 INFO  L231             Difference]: Finished difference. Result has 102 places, 101 transitions, 959 flow
[2024-06-04 18:10:22,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=959, PETRI_PLACES=102, PETRI_TRANSITIONS=101}
[2024-06-04 18:10:22,739 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places.
[2024-06-04 18:10:22,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 101 transitions, 959 flow
[2024-06-04 18:10:22,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:22,739 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:22,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:22,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:10:22,740 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:22,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:22,740 INFO  L85        PathProgramCache]: Analyzing trace with hash -629303033, now seen corresponding path program 2 times
[2024-06-04 18:10:22,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:22,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303582586]
[2024-06-04 18:10:22,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:22,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:22,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:30,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:30,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:30,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303582586]
[2024-06-04 18:10:30,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303582586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:30,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:30,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:30,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370491998]
[2024-06-04 18:10:30,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:30,831 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:30,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:30,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:30,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:30,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:30,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 101 transitions, 959 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:30,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:30,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:30,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:31,937 INFO  L124   PetriNetUnfolderBase]: 1746/2680 cut-off events.
[2024-06-04 18:10:31,938 INFO  L125   PetriNetUnfolderBase]: For 46841/46843 co-relation queries the response was YES.
[2024-06-04 18:10:31,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14691 conditions, 2680 events. 1746/2680 cut-off events. For 46841/46843 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12875 event pairs, 461 based on Foata normal form. 6/2685 useless extension candidates. Maximal degree in co-relation 14640. Up to 2435 conditions per place. 
[2024-06-04 18:10:31,954 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 102 selfloop transitions, 25 changer transitions 0/130 dead transitions.
[2024-06-04 18:10:31,954 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 130 transitions, 1317 flow
[2024-06-04 18:10:31,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:31,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:31,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 18:10:31,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-04 18:10:31,955 INFO  L175             Difference]: Start difference. First operand has 102 places, 101 transitions, 959 flow. Second operand 7 states and 124 transitions.
[2024-06-04 18:10:31,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 130 transitions, 1317 flow
[2024-06-04 18:10:31,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 130 transitions, 1252 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 18:10:31,989 INFO  L231             Difference]: Finished difference. Result has 105 places, 105 transitions, 1010 flow
[2024-06-04 18:10:31,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1010, PETRI_PLACES=105, PETRI_TRANSITIONS=105}
[2024-06-04 18:10:31,989 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places.
[2024-06-04 18:10:31,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 1010 flow
[2024-06-04 18:10:31,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:31,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:31,990 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:31,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:10:31,990 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:31,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:31,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -1168022959, now seen corresponding path program 3 times
[2024-06-04 18:10:31,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:31,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647251299]
[2024-06-04 18:10:31,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:31,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:32,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:40,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:40,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:40,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647251299]
[2024-06-04 18:10:40,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647251299] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:40,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:40,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:40,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254826165]
[2024-06-04 18:10:40,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:40,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:40,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:40,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:40,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:40,460 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:40,460 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 1010 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:40,460 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:40,460 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:40,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:41,483 INFO  L124   PetriNetUnfolderBase]: 1763/2708 cut-off events.
[2024-06-04 18:10:41,483 INFO  L125   PetriNetUnfolderBase]: For 51066/51071 co-relation queries the response was YES.
[2024-06-04 18:10:41,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15175 conditions, 2708 events. 1763/2708 cut-off events. For 51066/51071 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12988 event pairs, 479 based on Foata normal form. 8/2715 useless extension candidates. Maximal degree in co-relation 15122. Up to 2504 conditions per place. 
[2024-06-04 18:10:41,498 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 100 selfloop transitions, 32 changer transitions 0/135 dead transitions.
[2024-06-04 18:10:41,498 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 135 transitions, 1384 flow
[2024-06-04 18:10:41,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:41,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:41,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-04 18:10:41,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4607142857142857
[2024-06-04 18:10:41,501 INFO  L175             Difference]: Start difference. First operand has 105 places, 105 transitions, 1010 flow. Second operand 7 states and 129 transitions.
[2024-06-04 18:10:41,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 135 transitions, 1384 flow
[2024-06-04 18:10:41,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 1320 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-04 18:10:41,540 INFO  L231             Difference]: Finished difference. Result has 108 places, 107 transitions, 1060 flow
[2024-06-04 18:10:41,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1060, PETRI_PLACES=108, PETRI_TRANSITIONS=107}
[2024-06-04 18:10:41,541 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places.
[2024-06-04 18:10:41,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 107 transitions, 1060 flow
[2024-06-04 18:10:41,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:41,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:41,541 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:41,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:10:41,541 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:41,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:41,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -1168016449, now seen corresponding path program 4 times
[2024-06-04 18:10:41,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:41,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206887460]
[2024-06-04 18:10:41,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:41,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:41,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:50,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:50,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:50,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206887460]
[2024-06-04 18:10:50,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206887460] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:50,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:50,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:50,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849853805]
[2024-06-04 18:10:50,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:50,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:50,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:50,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:50,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:50,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:50,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 107 transitions, 1060 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:50,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:50,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:50,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:51,434 INFO  L124   PetriNetUnfolderBase]: 1780/2735 cut-off events.
[2024-06-04 18:10:51,434 INFO  L125   PetriNetUnfolderBase]: For 56205/56210 co-relation queries the response was YES.
[2024-06-04 18:10:51,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15635 conditions, 2735 events. 1780/2735 cut-off events. For 56205/56210 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13216 event pairs, 470 based on Foata normal form. 8/2742 useless extension candidates. Maximal degree in co-relation 15581. Up to 2403 conditions per place. 
[2024-06-04 18:10:51,447 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 93 selfloop transitions, 38 changer transitions 0/134 dead transitions.
[2024-06-04 18:10:51,447 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 1426 flow
[2024-06-04 18:10:51,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:51,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:51,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-04 18:10:51,449 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-04 18:10:51,449 INFO  L175             Difference]: Start difference. First operand has 108 places, 107 transitions, 1060 flow. Second operand 7 states and 125 transitions.
[2024-06-04 18:10:51,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 1426 flow
[2024-06-04 18:10:51,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 1328 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-04 18:10:51,509 INFO  L231             Difference]: Finished difference. Result has 110 places, 109 transitions, 1093 flow
[2024-06-04 18:10:51,521 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1093, PETRI_PLACES=110, PETRI_TRANSITIONS=109}
[2024-06-04 18:10:51,521 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places.
[2024-06-04 18:10:51,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 1093 flow
[2024-06-04 18:10:51,522 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:51,522 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:51,522 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:51,522 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:10:51,522 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:51,522 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:51,523 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044877979, now seen corresponding path program 5 times
[2024-06-04 18:10:51,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:51,523 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931283205]
[2024-06-04 18:10:51,523 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:51,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:51,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:59,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:59,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:59,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931283205]
[2024-06-04 18:10:59,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931283205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:59,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:59,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:59,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640482923]
[2024-06-04 18:10:59,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:59,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:59,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:59,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:59,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:59,754 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:10:59,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 109 transitions, 1093 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:59,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:59,755 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:10:59,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:00,664 INFO  L124   PetriNetUnfolderBase]: 1772/2723 cut-off events.
[2024-06-04 18:11:00,664 INFO  L125   PetriNetUnfolderBase]: For 54666/54671 co-relation queries the response was YES.
[2024-06-04 18:11:00,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15462 conditions, 2723 events. 1772/2723 cut-off events. For 54666/54671 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13112 event pairs, 522 based on Foata normal form. 8/2730 useless extension candidates. Maximal degree in co-relation 15407. Up to 2626 conditions per place. 
[2024-06-04 18:11:00,680 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 115 selfloop transitions, 15 changer transitions 0/133 dead transitions.
[2024-06-04 18:11:00,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 133 transitions, 1447 flow
[2024-06-04 18:11:00,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:00,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:00,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-04 18:11:00,683 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-04 18:11:00,683 INFO  L175             Difference]: Start difference. First operand has 110 places, 109 transitions, 1093 flow. Second operand 7 states and 118 transitions.
[2024-06-04 18:11:00,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 133 transitions, 1447 flow
[2024-06-04 18:11:00,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 133 transitions, 1338 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-04 18:11:00,732 INFO  L231             Difference]: Finished difference. Result has 112 places, 111 transitions, 1065 flow
[2024-06-04 18:11:00,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1065, PETRI_PLACES=112, PETRI_TRANSITIONS=111}
[2024-06-04 18:11:00,733 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places.
[2024-06-04 18:11:00,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 111 transitions, 1065 flow
[2024-06-04 18:11:00,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:00,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:00,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:00,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:11:00,733 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:00,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:00,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -2063567229, now seen corresponding path program 1 times
[2024-06-04 18:11:00,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:00,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777420471]
[2024-06-04 18:11:00,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:00,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:00,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:14,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-04 18:11:14,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:14,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777420471]
[2024-06-04 18:11:14,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777420471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:14,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:14,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:14,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731768811]
[2024-06-04 18:11:14,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:14,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:14,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:14,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:14,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:14,202 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:11:14,202 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 111 transitions, 1065 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:14,202 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:14,202 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:11:14,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:15,305 INFO  L124   PetriNetUnfolderBase]: 1802/2763 cut-off events.
[2024-06-04 18:11:15,305 INFO  L125   PetriNetUnfolderBase]: For 54453/54453 co-relation queries the response was YES.
[2024-06-04 18:11:15,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15434 conditions, 2763 events. 1802/2763 cut-off events. For 54453/54453 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13348 event pairs, 544 based on Foata normal form. 6/2768 useless extension candidates. Maximal degree in co-relation 15378. Up to 2660 conditions per place. 
[2024-06-04 18:11:15,320 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 113 selfloop transitions, 22 changer transitions 0/138 dead transitions.
[2024-06-04 18:11:15,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 138 transitions, 1510 flow
[2024-06-04 18:11:15,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:15,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:15,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:11:15,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-04 18:11:15,322 INFO  L175             Difference]: Start difference. First operand has 112 places, 111 transitions, 1065 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:11:15,322 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 138 transitions, 1510 flow
[2024-06-04 18:11:15,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 138 transitions, 1449 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 18:11:15,360 INFO  L231             Difference]: Finished difference. Result has 115 places, 119 transitions, 1143 flow
[2024-06-04 18:11:15,360 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1143, PETRI_PLACES=115, PETRI_TRANSITIONS=119}
[2024-06-04 18:11:15,361 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places.
[2024-06-04 18:11:15,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 1143 flow
[2024-06-04 18:11:15,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:15,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:15,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:15,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:11:15,362 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:15,363 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:15,363 INFO  L85        PathProgramCache]: Analyzing trace with hash 115345679, now seen corresponding path program 2 times
[2024-06-04 18:11:15,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:15,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311268206]
[2024-06-04 18:11:15,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:15,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:15,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:27,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:27,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:27,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311268206]
[2024-06-04 18:11:27,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311268206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:27,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:27,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:11:27,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080990205]
[2024-06-04 18:11:27,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:27,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:11:27,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:27,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:11:27,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:11:27,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:11:27,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 1143 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:27,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:27,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:11:27,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:28,855 INFO  L124   PetriNetUnfolderBase]: 1784/2739 cut-off events.
[2024-06-04 18:11:28,856 INFO  L125   PetriNetUnfolderBase]: For 56817/56817 co-relation queries the response was YES.
[2024-06-04 18:11:28,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15548 conditions, 2739 events. 1784/2739 cut-off events. For 56817/56817 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13215 event pairs, 533 based on Foata normal form. 6/2744 useless extension candidates. Maximal degree in co-relation 15490. Up to 2673 conditions per place. 
[2024-06-04 18:11:28,873 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 112 selfloop transitions, 18 changer transitions 0/133 dead transitions.
[2024-06-04 18:11:28,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 1441 flow
[2024-06-04 18:11:28,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:11:28,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:11:28,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-04 18:11:28,874 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46
[2024-06-04 18:11:28,874 INFO  L175             Difference]: Start difference. First operand has 115 places, 119 transitions, 1143 flow. Second operand 5 states and 92 transitions.
[2024-06-04 18:11:28,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 1441 flow
[2024-06-04 18:11:28,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 1396 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-04 18:11:28,925 INFO  L231             Difference]: Finished difference. Result has 118 places, 119 transitions, 1147 flow
[2024-06-04 18:11:28,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1147, PETRI_PLACES=118, PETRI_TRANSITIONS=119}
[2024-06-04 18:11:28,926 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places.
[2024-06-04 18:11:28,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 119 transitions, 1147 flow
[2024-06-04 18:11:28,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:28,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:28,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:28,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:11:28,926 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-04 18:11:28,927 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:28,927 INFO  L85        PathProgramCache]: Analyzing trace with hash 1368368530, now seen corresponding path program 1 times
[2024-06-04 18:11:28,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:28,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518571790]
[2024-06-04 18:11:28,927 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:28,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:28,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:37,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:37,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:37,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518571790]
[2024-06-04 18:11:37,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518571790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:37,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:37,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:37,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567288018]
[2024-06-04 18:11:37,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:37,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:37,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:37,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:37,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:37,707 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:11:37,707 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 119 transitions, 1147 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:37,708 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:37,708 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:11:37,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:38,866 INFO  L124   PetriNetUnfolderBase]: 1825/2811 cut-off events.
[2024-06-04 18:11:38,866 INFO  L125   PetriNetUnfolderBase]: For 62811/62813 co-relation queries the response was YES.
[2024-06-04 18:11:38,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15982 conditions, 2811 events. 1825/2811 cut-off events. For 62811/62813 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13748 event pairs, 467 based on Foata normal form. 14/2824 useless extension candidates. Maximal degree in co-relation 15922. Up to 2566 conditions per place. 
[2024-06-04 18:11:38,881 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 124 selfloop transitions, 24 changer transitions 0/151 dead transitions.
[2024-06-04 18:11:38,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 151 transitions, 1559 flow
[2024-06-04 18:11:38,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:11:38,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:11:38,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:11:38,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44375
[2024-06-04 18:11:38,884 INFO  L175             Difference]: Start difference. First operand has 118 places, 119 transitions, 1147 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:11:38,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 151 transitions, 1559 flow
[2024-06-04 18:11:38,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 151 transitions, 1523 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-04 18:11:38,933 INFO  L231             Difference]: Finished difference. Result has 122 places, 120 transitions, 1193 flow
[2024-06-04 18:11:38,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1193, PETRI_PLACES=122, PETRI_TRANSITIONS=120}
[2024-06-04 18:11:38,934 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places.
[2024-06-04 18:11:38,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 1193 flow
[2024-06-04 18:11:38,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:38,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:38,934 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:38,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:11:38,935 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-04 18:11:38,935 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:38,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 484381659, now seen corresponding path program 1 times
[2024-06-04 18:11:38,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:38,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976606602]
[2024-06-04 18:11:38,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:38,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:38,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:48,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:48,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:48,263 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976606602]
[2024-06-04 18:11:48,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976606602] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:48,263 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:48,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:48,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512631239]
[2024-06-04 18:11:48,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:48,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:48,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:48,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:48,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:48,397 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:11:48,397 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 1193 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:48,397 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:48,398 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:11:48,398 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:49,404 INFO  L124   PetriNetUnfolderBase]: 2014/3072 cut-off events.
[2024-06-04 18:11:49,404 INFO  L125   PetriNetUnfolderBase]: For 73436/73438 co-relation queries the response was YES.
[2024-06-04 18:11:49,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18061 conditions, 3072 events. 2014/3072 cut-off events. For 73436/73438 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15091 event pairs, 522 based on Foata normal form. 11/3082 useless extension candidates. Maximal degree in co-relation 18000. Up to 2707 conditions per place. 
[2024-06-04 18:11:49,422 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 129 selfloop transitions, 36 changer transitions 0/168 dead transitions.
[2024-06-04 18:11:49,422 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 1889 flow
[2024-06-04 18:11:49,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:49,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:49,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 18:11:49,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48928571428571427
[2024-06-04 18:11:49,423 INFO  L175             Difference]: Start difference. First operand has 122 places, 120 transitions, 1193 flow. Second operand 7 states and 137 transitions.
[2024-06-04 18:11:49,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 1889 flow
[2024-06-04 18:11:49,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 168 transitions, 1823 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-04 18:11:49,486 INFO  L231             Difference]: Finished difference. Result has 125 places, 136 transitions, 1426 flow
[2024-06-04 18:11:49,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1426, PETRI_PLACES=125, PETRI_TRANSITIONS=136}
[2024-06-04 18:11:49,486 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places.
[2024-06-04 18:11:49,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 136 transitions, 1426 flow
[2024-06-04 18:11:49,487 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:49,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:49,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:49,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:11:49,487 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:49,487 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:49,488 INFO  L85        PathProgramCache]: Analyzing trace with hash -1333315658, now seen corresponding path program 2 times
[2024-06-04 18:11:49,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:49,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828343566]
[2024-06-04 18:11:49,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:49,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:49,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:58,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:58,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:58,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828343566]
[2024-06-04 18:11:58,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828343566] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:58,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:58,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:58,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867344890]
[2024-06-04 18:11:58,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:58,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:58,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:58,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:58,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:59,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:11:59,060 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 136 transitions, 1426 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:59,060 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:59,060 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:11:59,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:00,299 INFO  L124   PetriNetUnfolderBase]: 2055/3143 cut-off events.
[2024-06-04 18:12:00,299 INFO  L125   PetriNetUnfolderBase]: For 81754/81756 co-relation queries the response was YES.
[2024-06-04 18:12:00,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19512 conditions, 3143 events. 2055/3143 cut-off events. For 81754/81756 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15616 event pairs, 529 based on Foata normal form. 14/3156 useless extension candidates. Maximal degree in co-relation 19448. Up to 2916 conditions per place. 
[2024-06-04 18:12:00,316 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 144 selfloop transitions, 24 changer transitions 0/171 dead transitions.
[2024-06-04 18:12:00,317 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 171 transitions, 1894 flow
[2024-06-04 18:12:00,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:00,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:00,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 18:12:00,319 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:12:00,319 INFO  L175             Difference]: Start difference. First operand has 125 places, 136 transitions, 1426 flow. Second operand 8 states and 144 transitions.
[2024-06-04 18:12:00,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 171 transitions, 1894 flow
[2024-06-04 18:12:00,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 171 transitions, 1842 flow, removed 25 selfloop flow, removed 1 redundant places.
[2024-06-04 18:12:00,403 INFO  L231             Difference]: Finished difference. Result has 132 places, 137 transitions, 1458 flow
[2024-06-04 18:12:00,403 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1458, PETRI_PLACES=132, PETRI_TRANSITIONS=137}
[2024-06-04 18:12:00,404 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 91 predicate places.
[2024-06-04 18:12:00,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 1458 flow
[2024-06-04 18:12:00,404 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:00,404 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:00,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-04 18:12:00,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:12:00,405 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:00,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:00,405 INFO  L85        PathProgramCache]: Analyzing trace with hash 1966443658, now seen corresponding path program 3 times
[2024-06-04 18:12:00,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:00,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310715167]
[2024-06-04 18:12:00,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:00,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:00,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:09,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:09,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:09,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310715167]
[2024-06-04 18:12:09,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310715167] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:09,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:09,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:12:09,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452997539]
[2024-06-04 18:12:09,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:09,068 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:12:09,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:09,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:12:09,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:12:09,257 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:12:09,258 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 1458 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:09,259 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:09,259 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:12:09,259 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:10,428 INFO  L124   PetriNetUnfolderBase]: 2096/3215 cut-off events.
[2024-06-04 18:12:10,428 INFO  L125   PetriNetUnfolderBase]: For 88406/88411 co-relation queries the response was YES.
[2024-06-04 18:12:10,439 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19977 conditions, 3215 events. 2096/3215 cut-off events. For 88406/88411 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16165 event pairs, 529 based on Foata normal form. 16/3230 useless extension candidates. Maximal degree in co-relation 19910. Up to 2804 conditions per place. 
[2024-06-04 18:12:10,449 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 126 selfloop transitions, 40 changer transitions 0/169 dead transitions.
[2024-06-04 18:12:10,449 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 169 transitions, 1910 flow
[2024-06-04 18:12:10,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:10,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:10,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-04 18:12:10,452 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-04 18:12:10,452 INFO  L175             Difference]: Start difference. First operand has 132 places, 137 transitions, 1458 flow. Second operand 8 states and 141 transitions.
[2024-06-04 18:12:10,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 169 transitions, 1910 flow
[2024-06-04 18:12:10,543 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 169 transitions, 1842 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-04 18:12:10,546 INFO  L231             Difference]: Finished difference. Result has 134 places, 138 transitions, 1509 flow
[2024-06-04 18:12:10,546 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1509, PETRI_PLACES=134, PETRI_TRANSITIONS=138}
[2024-06-04 18:12:10,546 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places.
[2024-06-04 18:12:10,546 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 138 transitions, 1509 flow
[2024-06-04 18:12:10,547 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:10,547 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:10,547 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:10,547 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:12:10,547 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:10,548 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:10,548 INFO  L85        PathProgramCache]: Analyzing trace with hash 484390959, now seen corresponding path program 2 times
[2024-06-04 18:12:10,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:10,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104912945]
[2024-06-04 18:12:10,548 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:10,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:10,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:20,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:20,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:20,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104912945]
[2024-06-04 18:12:20,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104912945] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:20,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:20,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:20,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982226535]
[2024-06-04 18:12:20,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:20,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:20,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:20,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:20,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:20,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:12:20,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 138 transitions, 1509 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:20,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:20,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:12:20,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:21,410 INFO  L124   PetriNetUnfolderBase]: 2264/3447 cut-off events.
[2024-06-04 18:12:21,411 INFO  L125   PetriNetUnfolderBase]: For 97741/97741 co-relation queries the response was YES.
[2024-06-04 18:12:21,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21835 conditions, 3447 events. 2264/3447 cut-off events. For 97741/97741 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17350 event pairs, 637 based on Foata normal form. 9/3455 useless extension candidates. Maximal degree in co-relation 21767. Up to 3262 conditions per place. 
[2024-06-04 18:12:21,430 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 148 selfloop transitions, 25 changer transitions 0/176 dead transitions.
[2024-06-04 18:12:21,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 176 transitions, 2132 flow
[2024-06-04 18:12:21,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:21,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:21,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-04 18:12:21,431 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.434375
[2024-06-04 18:12:21,431 INFO  L175             Difference]: Start difference. First operand has 134 places, 138 transitions, 1509 flow. Second operand 8 states and 139 transitions.
[2024-06-04 18:12:21,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 176 transitions, 2132 flow
[2024-06-04 18:12:21,517 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 176 transitions, 2031 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-04 18:12:21,519 INFO  L231             Difference]: Finished difference. Result has 137 places, 149 transitions, 1619 flow
[2024-06-04 18:12:21,519 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1619, PETRI_PLACES=137, PETRI_TRANSITIONS=149}
[2024-06-04 18:12:21,519 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places.
[2024-06-04 18:12:21,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 149 transitions, 1619 flow
[2024-06-04 18:12:21,520 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:21,520 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:21,520 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:21,520 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:12:21,520 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-04 18:12:21,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:21,521 INFO  L85        PathProgramCache]: Analyzing trace with hash 714207892, now seen corresponding path program 4 times
[2024-06-04 18:12:21,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:21,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036798145]
[2024-06-04 18:12:21,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:21,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:21,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:29,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:29,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:29,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036798145]
[2024-06-04 18:12:29,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036798145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:29,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:29,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:29,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639716077]
[2024-06-04 18:12:29,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:29,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:29,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:29,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:29,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:30,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:12:30,176 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 149 transitions, 1619 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:30,176 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:30,176 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:12:30,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:31,456 INFO  L124   PetriNetUnfolderBase]: 2305/3520 cut-off events.
[2024-06-04 18:12:31,456 INFO  L125   PetriNetUnfolderBase]: For 105078/105083 co-relation queries the response was YES.
[2024-06-04 18:12:31,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22437 conditions, 3520 events. 2305/3520 cut-off events. For 105078/105083 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17903 event pairs, 603 based on Foata normal form. 16/3535 useless extension candidates. Maximal degree in co-relation 22367. Up to 3178 conditions per place. 
[2024-06-04 18:12:31,477 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 146 selfloop transitions, 35 changer transitions 0/184 dead transitions.
[2024-06-04 18:12:31,478 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 184 transitions, 2117 flow
[2024-06-04 18:12:31,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:31,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:31,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-04 18:12:31,480 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453125
[2024-06-04 18:12:31,480 INFO  L175             Difference]: Start difference. First operand has 137 places, 149 transitions, 1619 flow. Second operand 8 states and 145 transitions.
[2024-06-04 18:12:31,480 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 184 transitions, 2117 flow
[2024-06-04 18:12:31,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 184 transitions, 2027 flow, removed 27 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:31,627 INFO  L231             Difference]: Finished difference. Result has 141 places, 150 transitions, 1641 flow
[2024-06-04 18:12:31,628 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1641, PETRI_PLACES=141, PETRI_TRANSITIONS=150}
[2024-06-04 18:12:31,628 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places.
[2024-06-04 18:12:31,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 150 transitions, 1641 flow
[2024-06-04 18:12:31,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:31,628 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:31,629 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:31,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:12:31,629 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:31,629 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:31,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -1592269840, now seen corresponding path program 5 times
[2024-06-04 18:12:31,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:31,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550047410]
[2024-06-04 18:12:31,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:31,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:31,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:41,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:41,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:41,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550047410]
[2024-06-04 18:12:41,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550047410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:41,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:41,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:12:41,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992375162]
[2024-06-04 18:12:41,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:41,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:12:41,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:41,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:12:41,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:12:41,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:12:41,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 150 transitions, 1641 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:41,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:41,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:12:41,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:42,728 INFO  L124   PetriNetUnfolderBase]: 2285/3488 cut-off events.
[2024-06-04 18:12:42,729 INFO  L125   PetriNetUnfolderBase]: For 106469/106474 co-relation queries the response was YES.
[2024-06-04 18:12:42,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21858 conditions, 3488 events. 2285/3488 cut-off events. For 106469/106474 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17667 event pairs, 657 based on Foata normal form. 16/3503 useless extension candidates. Maximal degree in co-relation 21787. Up to 3322 conditions per place. 
[2024-06-04 18:12:42,749 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 158 selfloop transitions, 17 changer transitions 0/178 dead transitions.
[2024-06-04 18:12:42,749 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 178 transitions, 2067 flow
[2024-06-04 18:12:42,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:42,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:42,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-04 18:12:42,751 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41875
[2024-06-04 18:12:42,751 INFO  L175             Difference]: Start difference. First operand has 141 places, 150 transitions, 1641 flow. Second operand 8 states and 134 transitions.
[2024-06-04 18:12:42,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 178 transitions, 2067 flow
[2024-06-04 18:12:42,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 178 transitions, 1963 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-04 18:12:42,843 INFO  L231             Difference]: Finished difference. Result has 142 places, 150 transitions, 1577 flow
[2024-06-04 18:12:42,843 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1577, PETRI_PLACES=142, PETRI_TRANSITIONS=150}
[2024-06-04 18:12:42,843 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 101 predicate places.
[2024-06-04 18:12:42,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 150 transitions, 1577 flow
[2024-06-04 18:12:42,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:42,844 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:42,844 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:42,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:12:42,844 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:42,844 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:42,845 INFO  L85        PathProgramCache]: Analyzing trace with hash -1772248679, now seen corresponding path program 3 times
[2024-06-04 18:12:42,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:42,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408325052]
[2024-06-04 18:12:42,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:42,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:42,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:52,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:52,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:52,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408325052]
[2024-06-04 18:12:52,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408325052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:52,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:52,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:52,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867668089]
[2024-06-04 18:12:52,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:52,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:52,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:52,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:52,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:52,198 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:12:52,199 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 150 transitions, 1577 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:52,199 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:52,199 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:12:52,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:53,387 INFO  L124   PetriNetUnfolderBase]: 2414/3666 cut-off events.
[2024-06-04 18:12:53,387 INFO  L125   PetriNetUnfolderBase]: For 103118/103118 co-relation queries the response was YES.
[2024-06-04 18:12:53,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22822 conditions, 3666 events. 2414/3666 cut-off events. For 103118/103118 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18660 event pairs, 630 based on Foata normal form. 9/3674 useless extension candidates. Maximal degree in co-relation 22751. Up to 3374 conditions per place. 
[2024-06-04 18:12:53,411 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 150 selfloop transitions, 37 changer transitions 0/190 dead transitions.
[2024-06-04 18:12:53,411 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 190 transitions, 2229 flow
[2024-06-04 18:12:53,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:12:53,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:12:53,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 18:12:53,413 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-04 18:12:53,413 INFO  L175             Difference]: Start difference. First operand has 142 places, 150 transitions, 1577 flow. Second operand 7 states and 135 transitions.
[2024-06-04 18:12:53,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 190 transitions, 2229 flow
[2024-06-04 18:12:53,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 190 transitions, 2146 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-04 18:12:53,527 INFO  L231             Difference]: Finished difference. Result has 144 places, 159 transitions, 1753 flow
[2024-06-04 18:12:53,528 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1753, PETRI_PLACES=144, PETRI_TRANSITIONS=159}
[2024-06-04 18:12:53,528 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places.
[2024-06-04 18:12:53,528 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 159 transitions, 1753 flow
[2024-06-04 18:12:53,528 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:53,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:53,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:53,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:12:53,529 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:53,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:53,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -719048448, now seen corresponding path program 1 times
[2024-06-04 18:12:53,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:53,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785935552]
[2024-06-04 18:12:53,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:53,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:53,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:02,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-04 18:13:02,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:02,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785935552]
[2024-06-04 18:13:02,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785935552] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:02,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:02,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:02,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646643749]
[2024-06-04 18:13:02,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:02,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:02,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:02,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:02,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:02,664 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:13:02,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 159 transitions, 1753 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:02,665 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:02,665 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:13:02,665 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:03,835 INFO  L124   PetriNetUnfolderBase]: 2408/3658 cut-off events.
[2024-06-04 18:13:03,835 INFO  L125   PetriNetUnfolderBase]: For 105272/105272 co-relation queries the response was YES.
[2024-06-04 18:13:03,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23107 conditions, 3658 events. 2408/3658 cut-off events. For 105272/105272 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18552 event pairs, 673 based on Foata normal form. 2/3659 useless extension candidates. Maximal degree in co-relation 23034. Up to 3595 conditions per place. 
[2024-06-04 18:13:03,855 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 154 selfloop transitions, 21 changer transitions 0/178 dead transitions.
[2024-06-04 18:13:03,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 178 transitions, 2189 flow
[2024-06-04 18:13:03,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:13:03,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:13:03,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions.
[2024-06-04 18:13:03,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47
[2024-06-04 18:13:03,857 INFO  L175             Difference]: Start difference. First operand has 144 places, 159 transitions, 1753 flow. Second operand 5 states and 94 transitions.
[2024-06-04 18:13:03,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 178 transitions, 2189 flow
[2024-06-04 18:13:03,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 178 transitions, 2116 flow, removed 21 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:03,981 INFO  L231             Difference]: Finished difference. Result has 146 places, 162 transitions, 1785 flow
[2024-06-04 18:13:03,981 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1785, PETRI_PLACES=146, PETRI_TRANSITIONS=162}
[2024-06-04 18:13:03,981 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 105 predicate places.
[2024-06-04 18:13:03,982 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 162 transitions, 1785 flow
[2024-06-04 18:13:03,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:03,982 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:03,982 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:03,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:13:03,982 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:03,982 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:03,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -719034560, now seen corresponding path program 1 times
[2024-06-04 18:13:03,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:03,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336497730]
[2024-06-04 18:13:03,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:03,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:04,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:16,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:16,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:16,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336497730]
[2024-06-04 18:13:16,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336497730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:16,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:16,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:16,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123538557]
[2024-06-04 18:13:16,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:16,049 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:16,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:16,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:16,050 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:16,155 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:13:16,156 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 162 transitions, 1785 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:16,156 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:16,156 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:13:16,156 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:17,317 INFO  L124   PetriNetUnfolderBase]: 2403/3651 cut-off events.
[2024-06-04 18:13:17,317 INFO  L125   PetriNetUnfolderBase]: For 109813/109813 co-relation queries the response was YES.
[2024-06-04 18:13:17,329 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23087 conditions, 3651 events. 2403/3651 cut-off events. For 109813/109813 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 18450 event pairs, 728 based on Foata normal form. 2/3652 useless extension candidates. Maximal degree in co-relation 23013. Up to 3623 conditions per place. 
[2024-06-04 18:13:17,339 INFO  L140   encePairwiseOnDemand]: 34/40 looper letters, 158 selfloop transitions, 12 changer transitions 0/173 dead transitions.
[2024-06-04 18:13:17,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 173 transitions, 2173 flow
[2024-06-04 18:13:17,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:13:17,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:13:17,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions.
[2024-06-04 18:13:17,340 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:13:17,340 INFO  L175             Difference]: Start difference. First operand has 146 places, 162 transitions, 1785 flow. Second operand 5 states and 85 transitions.
[2024-06-04 18:13:17,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 173 transitions, 2173 flow
[2024-06-04 18:13:17,463 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 173 transitions, 2128 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:17,465 INFO  L231             Difference]: Finished difference. Result has 148 places, 164 transitions, 1799 flow
[2024-06-04 18:13:17,466 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1799, PETRI_PLACES=148, PETRI_TRANSITIONS=164}
[2024-06-04 18:13:17,466 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places.
[2024-06-04 18:13:17,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 164 transitions, 1799 flow
[2024-06-04 18:13:17,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:17,466 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:17,467 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:17,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:13:17,467 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-04 18:13:17,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:17,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -1765558334, now seen corresponding path program 1 times
[2024-06-04 18:13:17,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:17,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590429461]
[2024-06-04 18:13:17,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:17,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:17,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:26,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:26,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:26,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590429461]
[2024-06-04 18:13:26,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590429461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:26,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:26,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:13:26,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789147450]
[2024-06-04 18:13:26,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:26,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:13:26,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:26,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:13:26,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:13:26,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:13:26,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 164 transitions, 1799 flow. Second operand  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:26,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:26,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:13:26,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:27,908 INFO  L124   PetriNetUnfolderBase]: 2391/3633 cut-off events.
[2024-06-04 18:13:27,909 INFO  L125   PetriNetUnfolderBase]: For 114598/114601 co-relation queries the response was YES.
[2024-06-04 18:13:27,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23005 conditions, 3633 events. 2391/3633 cut-off events. For 114598/114601 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18390 event pairs, 640 based on Foata normal form. 10/3642 useless extension candidates. Maximal degree in co-relation 22930. Up to 3322 conditions per place. 
[2024-06-04 18:13:27,935 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 163 selfloop transitions, 34 changer transitions 0/200 dead transitions.
[2024-06-04 18:13:27,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 200 transitions, 2247 flow
[2024-06-04 18:13:27,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:27,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:27,939 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-04 18:13:27,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-04 18:13:27,960 INFO  L175             Difference]: Start difference. First operand has 148 places, 164 transitions, 1799 flow. Second operand 9 states and 159 transitions.
[2024-06-04 18:13:27,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 200 transitions, 2247 flow
[2024-06-04 18:13:28,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 200 transitions, 2188 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-04 18:13:28,110 INFO  L231             Difference]: Finished difference. Result has 152 places, 163 transitions, 1759 flow
[2024-06-04 18:13:28,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1759, PETRI_PLACES=152, PETRI_TRANSITIONS=163}
[2024-06-04 18:13:28,111 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 111 predicate places.
[2024-06-04 18:13:28,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 163 transitions, 1759 flow
[2024-06-04 18:13:28,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:28,111 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:28,111 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:28,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:13:28,111 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:28,112 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:28,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 2122648012, now seen corresponding path program 1 times
[2024-06-04 18:13:28,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:28,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482271774]
[2024-06-04 18:13:28,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:28,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:28,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:38,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:38,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:38,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482271774]
[2024-06-04 18:13:38,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482271774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:38,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:38,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:38,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228335373]
[2024-06-04 18:13:38,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:38,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:38,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:38,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:38,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:38,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:13:38,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 163 transitions, 1759 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:38,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:38,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:13:38,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:39,831 INFO  L124   PetriNetUnfolderBase]: 2422/3676 cut-off events.
[2024-06-04 18:13:39,831 INFO  L125   PetriNetUnfolderBase]: For 115421/115424 co-relation queries the response was YES.
[2024-06-04 18:13:39,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23365 conditions, 3676 events. 2422/3676 cut-off events. For 115421/115424 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18737 event pairs, 541 based on Foata normal form. 5/3680 useless extension candidates. Maximal degree in co-relation 23290. Up to 3250 conditions per place. 
[2024-06-04 18:13:39,857 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 164 selfloop transitions, 74 changer transitions 0/241 dead transitions.
[2024-06-04 18:13:39,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 241 transitions, 3068 flow
[2024-06-04 18:13:39,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:39,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:39,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:13:39,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.478125
[2024-06-04 18:13:39,858 INFO  L175             Difference]: Start difference. First operand has 152 places, 163 transitions, 1759 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:13:39,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 241 transitions, 3068 flow
[2024-06-04 18:13:40,013 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 241 transitions, 2978 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-04 18:13:40,016 INFO  L231             Difference]: Finished difference. Result has 155 places, 204 transitions, 2481 flow
[2024-06-04 18:13:40,017 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2481, PETRI_PLACES=155, PETRI_TRANSITIONS=204}
[2024-06-04 18:13:40,017 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places.
[2024-06-04 18:13:40,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 204 transitions, 2481 flow
[2024-06-04 18:13:40,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:40,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:40,018 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:40,018 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:13:40,018 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:40,018 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:40,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457653026, now seen corresponding path program 2 times
[2024-06-04 18:13:40,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:40,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922516379]
[2024-06-04 18:13:40,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:40,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:40,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:50,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:50,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:50,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922516379]
[2024-06-04 18:13:50,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922516379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:50,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:50,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:50,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388716406]
[2024-06-04 18:13:50,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:50,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:50,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:50,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:50,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:50,571 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:13:50,571 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 204 transitions, 2481 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:50,571 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:50,571 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:13:50,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:51,894 INFO  L124   PetriNetUnfolderBase]: 2437/3696 cut-off events.
[2024-06-04 18:13:51,895 INFO  L125   PetriNetUnfolderBase]: For 125258/125260 co-relation queries the response was YES.
[2024-06-04 18:13:51,909 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24876 conditions, 3696 events. 2437/3696 cut-off events. For 125258/125260 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18824 event pairs, 540 based on Foata normal form. 5/3700 useless extension candidates. Maximal degree in co-relation 24797. Up to 3410 conditions per place. 
[2024-06-04 18:13:51,922 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 185 selfloop transitions, 53 changer transitions 0/241 dead transitions.
[2024-06-04 18:13:51,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 241 transitions, 3282 flow
[2024-06-04 18:13:51,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:51,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:51,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 18:13:51,923 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:13:51,923 INFO  L175             Difference]: Start difference. First operand has 155 places, 204 transitions, 2481 flow. Second operand 8 states and 144 transitions.
[2024-06-04 18:13:51,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 241 transitions, 3282 flow
[2024-06-04 18:13:52,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 241 transitions, 3200 flow, removed 40 selfloop flow, removed 1 redundant places.
[2024-06-04 18:13:52,070 INFO  L231             Difference]: Finished difference. Result has 163 places, 211 transitions, 2637 flow
[2024-06-04 18:13:52,070 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2637, PETRI_PLACES=163, PETRI_TRANSITIONS=211}
[2024-06-04 18:13:52,070 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 122 predicate places.
[2024-06-04 18:13:52,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 211 transitions, 2637 flow
[2024-06-04 18:13:52,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:52,071 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:52,071 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:52,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:13:52,071 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:52,071 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:52,072 INFO  L85        PathProgramCache]: Analyzing trace with hash 1461227264, now seen corresponding path program 1 times
[2024-06-04 18:13:52,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:52,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690462483]
[2024-06-04 18:13:52,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:52,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:52,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:01,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:01,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:01,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690462483]
[2024-06-04 18:14:01,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690462483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:01,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:01,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:01,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952252089]
[2024-06-04 18:14:01,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:01,535 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:01,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:01,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:01,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:01,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:01,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 211 transitions, 2637 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:01,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:01,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:01,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:02,821 INFO  L124   PetriNetUnfolderBase]: 2545/3846 cut-off events.
[2024-06-04 18:14:02,821 INFO  L125   PetriNetUnfolderBase]: For 143263/143265 co-relation queries the response was YES.
[2024-06-04 18:14:02,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26707 conditions, 3846 events. 2545/3846 cut-off events. For 143263/143265 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19583 event pairs, 577 based on Foata normal form. 14/3859 useless extension candidates. Maximal degree in co-relation 26624. Up to 3132 conditions per place. 
[2024-06-04 18:14:02,850 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 166 selfloop transitions, 85 changer transitions 0/254 dead transitions.
[2024-06-04 18:14:02,850 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 254 transitions, 3694 flow
[2024-06-04 18:14:02,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:02,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:02,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-04 18:14:02,854 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-04 18:14:02,854 INFO  L175             Difference]: Start difference. First operand has 163 places, 211 transitions, 2637 flow. Second operand 7 states and 133 transitions.
[2024-06-04 18:14:02,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 254 transitions, 3694 flow
[2024-06-04 18:14:03,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 254 transitions, 3649 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-04 18:14:03,065 INFO  L231             Difference]: Finished difference. Result has 169 places, 226 transitions, 3132 flow
[2024-06-04 18:14:03,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3132, PETRI_PLACES=169, PETRI_TRANSITIONS=226}
[2024-06-04 18:14:03,077 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places.
[2024-06-04 18:14:03,077 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 3132 flow
[2024-06-04 18:14:03,078 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:03,078 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:03,078 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:03,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:14:03,078 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:03,078 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:03,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 1465988864, now seen corresponding path program 2 times
[2024-06-04 18:14:03,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:03,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165044189]
[2024-06-04 18:14:03,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:03,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:03,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:12,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:12,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:12,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165044189]
[2024-06-04 18:14:12,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165044189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:12,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:12,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:12,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458692156]
[2024-06-04 18:14:12,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:12,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:12,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:12,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:12,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:12,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:12,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 226 transitions, 3132 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:12,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:12,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:12,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:13,638 INFO  L124   PetriNetUnfolderBase]: 2497/3779 cut-off events.
[2024-06-04 18:14:13,638 INFO  L125   PetriNetUnfolderBase]: For 145125/145125 co-relation queries the response was YES.
[2024-06-04 18:14:13,655 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26779 conditions, 3779 events. 2497/3779 cut-off events. For 145125/145125 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19200 event pairs, 657 based on Foata normal form. 12/3790 useless extension candidates. Maximal degree in co-relation 26693. Up to 3633 conditions per place. 
[2024-06-04 18:14:13,669 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 216 selfloop transitions, 33 changer transitions 0/252 dead transitions.
[2024-06-04 18:14:13,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 252 transitions, 3731 flow
[2024-06-04 18:14:13,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:13,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:13,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-04 18:14:13,670 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.428125
[2024-06-04 18:14:13,670 INFO  L175             Difference]: Start difference. First operand has 169 places, 226 transitions, 3132 flow. Second operand 8 states and 137 transitions.
[2024-06-04 18:14:13,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 252 transitions, 3731 flow
[2024-06-04 18:14:13,855 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 252 transitions, 3516 flow, removed 70 selfloop flow, removed 3 redundant places.
[2024-06-04 18:14:13,859 INFO  L231             Difference]: Finished difference. Result has 174 places, 226 transitions, 2995 flow
[2024-06-04 18:14:13,859 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2995, PETRI_PLACES=174, PETRI_TRANSITIONS=226}
[2024-06-04 18:14:13,860 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places.
[2024-06-04 18:14:13,860 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 226 transitions, 2995 flow
[2024-06-04 18:14:13,860 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:13,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:13,861 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:13,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:14:13,861 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:13,861 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:13,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 1465984896, now seen corresponding path program 3 times
[2024-06-04 18:14:13,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:13,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080229985]
[2024-06-04 18:14:13,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:13,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:13,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:24,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-04 18:14:24,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:24,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080229985]
[2024-06-04 18:14:24,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080229985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:24,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:24,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:14:24,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141139307]
[2024-06-04 18:14:24,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:24,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:14:24,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:24,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:14:24,062 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:14:24,270 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:24,270 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 226 transitions, 2995 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:24,271 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:24,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:24,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:25,595 INFO  L124   PetriNetUnfolderBase]: 2512/3800 cut-off events.
[2024-06-04 18:14:25,596 INFO  L125   PetriNetUnfolderBase]: For 144522/144522 co-relation queries the response was YES.
[2024-06-04 18:14:25,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26459 conditions, 3800 events. 2512/3800 cut-off events. For 144522/144522 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 19338 event pairs, 665 based on Foata normal form. 3/3802 useless extension candidates. Maximal degree in co-relation 26372. Up to 3729 conditions per place. 
[2024-06-04 18:14:25,625 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 224 selfloop transitions, 29 changer transitions 0/256 dead transitions.
[2024-06-04 18:14:25,625 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 256 transitions, 3685 flow
[2024-06-04 18:14:25,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:25,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:25,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions.
[2024-06-04 18:14:25,626 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3972222222222222
[2024-06-04 18:14:25,626 INFO  L175             Difference]: Start difference. First operand has 174 places, 226 transitions, 2995 flow. Second operand 9 states and 143 transitions.
[2024-06-04 18:14:25,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 256 transitions, 3685 flow
[2024-06-04 18:14:25,790 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 256 transitions, 3622 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:25,794 INFO  L231             Difference]: Finished difference. Result has 180 places, 236 transitions, 3154 flow
[2024-06-04 18:14:25,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2936, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3154, PETRI_PLACES=180, PETRI_TRANSITIONS=236}
[2024-06-04 18:14:25,795 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places.
[2024-06-04 18:14:25,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 236 transitions, 3154 flow
[2024-06-04 18:14:25,795 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:25,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:25,795 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:25,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:14:25,795 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:25,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:25,796 INFO  L85        PathProgramCache]: Analyzing trace with hash 736877336, now seen corresponding path program 3 times
[2024-06-04 18:14:25,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:25,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169291827]
[2024-06-04 18:14:25,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:25,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:25,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:35,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:35,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:35,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169291827]
[2024-06-04 18:14:35,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169291827] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:35,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:35,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:35,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133971623]
[2024-06-04 18:14:35,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:35,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:35,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:35,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:35,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:35,230 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:35,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 236 transitions, 3154 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:35,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:35,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:35,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:36,442 INFO  L124   PetriNetUnfolderBase]: 2542/3842 cut-off events.
[2024-06-04 18:14:36,442 INFO  L125   PetriNetUnfolderBase]: For 154767/154767 co-relation queries the response was YES.
[2024-06-04 18:14:36,461 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27100 conditions, 3842 events. 2542/3842 cut-off events. For 154767/154767 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 19579 event pairs, 675 based on Foata normal form. 6/3847 useless extension candidates. Maximal degree in co-relation 27008. Up to 3699 conditions per place. 
[2024-06-04 18:14:36,475 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 226 selfloop transitions, 34 changer transitions 0/263 dead transitions.
[2024-06-04 18:14:36,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 263 transitions, 3947 flow
[2024-06-04 18:14:36,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:36,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:36,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-04 18:14:36,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-04 18:14:36,476 INFO  L175             Difference]: Start difference. First operand has 180 places, 236 transitions, 3154 flow. Second operand 7 states and 121 transitions.
[2024-06-04 18:14:36,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 263 transitions, 3947 flow
[2024-06-04 18:14:36,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 263 transitions, 3896 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-04 18:14:36,652 INFO  L231             Difference]: Finished difference. Result has 185 places, 241 transitions, 3296 flow
[2024-06-04 18:14:36,652 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3296, PETRI_PLACES=185, PETRI_TRANSITIONS=241}
[2024-06-04 18:14:36,653 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places.
[2024-06-04 18:14:36,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 241 transitions, 3296 flow
[2024-06-04 18:14:36,653 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:36,653 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:36,653 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:36,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:14:36,653 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:36,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:36,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 747352856, now seen corresponding path program 4 times
[2024-06-04 18:14:36,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:36,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879243762]
[2024-06-04 18:14:36,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:36,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:36,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:45,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-04 18:14:45,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:45,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879243762]
[2024-06-04 18:14:45,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879243762] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:45,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:45,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:45,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986496062]
[2024-06-04 18:14:45,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:45,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:45,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:45,565 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:45,565 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:45,668 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:45,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 241 transitions, 3296 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:45,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:45,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:45,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:46,857 INFO  L124   PetriNetUnfolderBase]: 2524/3818 cut-off events.
[2024-06-04 18:14:46,857 INFO  L125   PetriNetUnfolderBase]: For 157154/157154 co-relation queries the response was YES.
[2024-06-04 18:14:46,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26943 conditions, 3818 events. 2524/3818 cut-off events. For 157154/157154 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19472 event pairs, 672 based on Foata normal form. 6/3823 useless extension candidates. Maximal degree in co-relation 26849. Up to 3765 conditions per place. 
[2024-06-04 18:14:46,889 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 231 selfloop transitions, 22 changer transitions 0/256 dead transitions.
[2024-06-04 18:14:46,890 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 256 transitions, 3852 flow
[2024-06-04 18:14:46,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:46,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:46,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-04 18:14:46,891 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-04 18:14:46,891 INFO  L175             Difference]: Start difference. First operand has 185 places, 241 transitions, 3296 flow. Second operand 7 states and 113 transitions.
[2024-06-04 18:14:46,891 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 256 transitions, 3852 flow
[2024-06-04 18:14:47,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 256 transitions, 3555 flow, removed 44 selfloop flow, removed 7 redundant places.
[2024-06-04 18:14:47,110 INFO  L231             Difference]: Finished difference. Result has 185 places, 241 transitions, 3051 flow
[2024-06-04 18:14:47,111 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2999, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3051, PETRI_PLACES=185, PETRI_TRANSITIONS=241}
[2024-06-04 18:14:47,111 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places.
[2024-06-04 18:14:47,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 241 transitions, 3051 flow
[2024-06-04 18:14:47,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:47,111 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:47,111 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:47,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:14:47,112 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:47,112 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:47,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -1698595504, now seen corresponding path program 5 times
[2024-06-04 18:14:47,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:47,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822414268]
[2024-06-04 18:14:47,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:47,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:47,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:56,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:56,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:56,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822414268]
[2024-06-04 18:14:56,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822414268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:56,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:56,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:56,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158914562]
[2024-06-04 18:14:56,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:56,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:56,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:56,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:56,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:56,488 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:56,488 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 241 transitions, 3051 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:56,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:56,488 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:56,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:57,724 INFO  L124   PetriNetUnfolderBase]: 2488/3770 cut-off events.
[2024-06-04 18:14:57,725 INFO  L125   PetriNetUnfolderBase]: For 152887/152887 co-relation queries the response was YES.
[2024-06-04 18:14:57,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25751 conditions, 3770 events. 2488/3770 cut-off events. For 152887/152887 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19204 event pairs, 563 based on Foata normal form. 12/3781 useless extension candidates. Maximal degree in co-relation 25658. Up to 3459 conditions per place. 
[2024-06-04 18:14:57,756 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 221 selfloop transitions, 46 changer transitions 0/270 dead transitions.
[2024-06-04 18:14:57,756 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 270 transitions, 3774 flow
[2024-06-04 18:14:57,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:57,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:57,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-04 18:14:57,759 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46785714285714286
[2024-06-04 18:14:57,759 INFO  L175             Difference]: Start difference. First operand has 185 places, 241 transitions, 3051 flow. Second operand 7 states and 131 transitions.
[2024-06-04 18:14:57,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 270 transitions, 3774 flow
[2024-06-04 18:14:57,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 270 transitions, 3652 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:57,930 INFO  L231             Difference]: Finished difference. Result has 186 places, 241 transitions, 3040 flow
[2024-06-04 18:14:57,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3040, PETRI_PLACES=186, PETRI_TRANSITIONS=241}
[2024-06-04 18:14:57,930 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places.
[2024-06-04 18:14:57,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 241 transitions, 3040 flow
[2024-06-04 18:14:57,931 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:57,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:57,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:57,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:14:57,931 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:57,931 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:57,931 INFO  L85        PathProgramCache]: Analyzing trace with hash -821921490, now seen corresponding path program 6 times
[2024-06-04 18:14:57,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:57,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017240261]
[2024-06-04 18:14:57,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:57,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:57,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:06,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:06,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:06,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017240261]
[2024-06-04 18:15:06,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017240261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:06,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:06,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:06,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631501224]
[2024-06-04 18:15:06,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:06,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:06,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:06,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:06,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:07,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:15:07,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 241 transitions, 3040 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:07,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:07,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:15:07,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:08,200 INFO  L124   PetriNetUnfolderBase]: 2458/3728 cut-off events.
[2024-06-04 18:15:08,200 INFO  L125   PetriNetUnfolderBase]: For 150205/150205 co-relation queries the response was YES.
[2024-06-04 18:15:08,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25441 conditions, 3728 events. 2458/3728 cut-off events. For 150205/150205 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18968 event pairs, 644 based on Foata normal form. 6/3733 useless extension candidates. Maximal degree in co-relation 25348. Up to 3660 conditions per place. 
[2024-06-04 18:15:08,235 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 233 selfloop transitions, 22 changer transitions 0/258 dead transitions.
[2024-06-04 18:15:08,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 258 transitions, 3606 flow
[2024-06-04 18:15:08,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:15:08,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:15:08,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-04 18:15:08,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-04 18:15:08,237 INFO  L175             Difference]: Start difference. First operand has 186 places, 241 transitions, 3040 flow. Second operand 6 states and 105 transitions.
[2024-06-04 18:15:08,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 258 transitions, 3606 flow
[2024-06-04 18:15:08,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 258 transitions, 3473 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:08,436 INFO  L231             Difference]: Finished difference. Result has 186 places, 241 transitions, 2963 flow
[2024-06-04 18:15:08,436 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2907, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2963, PETRI_PLACES=186, PETRI_TRANSITIONS=241}
[2024-06-04 18:15:08,437 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places.
[2024-06-04 18:15:08,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 241 transitions, 2963 flow
[2024-06-04 18:15:08,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:08,437 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:08,437 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:08,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:15:08,437 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:08,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:08,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -815664388, now seen corresponding path program 1 times
[2024-06-04 18:15:08,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:08,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755532137]
[2024-06-04 18:15:08,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:08,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:08,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:17,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:17,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:17,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755532137]
[2024-06-04 18:15:17,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755532137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:17,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:17,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:15:17,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555123227]
[2024-06-04 18:15:17,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:17,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:15:17,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:17,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:15:17,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:15:17,384 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:15:17,384 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 241 transitions, 2963 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:17,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:17,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:15:17,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:18,713 INFO  L124   PetriNetUnfolderBase]: 2544/3848 cut-off events.
[2024-06-04 18:15:18,713 INFO  L125   PetriNetUnfolderBase]: For 153059/153059 co-relation queries the response was YES.
[2024-06-04 18:15:18,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26150 conditions, 3848 events. 2544/3848 cut-off events. For 153059/153059 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19629 event pairs, 556 based on Foata normal form. 6/3853 useless extension candidates. Maximal degree in co-relation 26058. Up to 3451 conditions per place. 
[2024-06-04 18:15:18,744 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 219 selfloop transitions, 63 changer transitions 0/285 dead transitions.
[2024-06-04 18:15:18,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 285 transitions, 3876 flow
[2024-06-04 18:15:18,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:18,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:18,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-04 18:15:18,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4928571428571429
[2024-06-04 18:15:18,747 INFO  L175             Difference]: Start difference. First operand has 186 places, 241 transitions, 2963 flow. Second operand 7 states and 138 transitions.
[2024-06-04 18:15:18,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 285 transitions, 3876 flow
[2024-06-04 18:15:18,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 285 transitions, 3765 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-04 18:15:18,967 INFO  L231             Difference]: Finished difference. Result has 188 places, 252 transitions, 3230 flow
[2024-06-04 18:15:18,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2852, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3230, PETRI_PLACES=188, PETRI_TRANSITIONS=252}
[2024-06-04 18:15:18,967 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places.
[2024-06-04 18:15:18,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 252 transitions, 3230 flow
[2024-06-04 18:15:18,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:18,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:18,968 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:18,968 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:15:18,968 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:18,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:18,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -827639378, now seen corresponding path program 4 times
[2024-06-04 18:15:18,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:18,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192898244]
[2024-06-04 18:15:18,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:18,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:19,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:28,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:28,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:28,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192898244]
[2024-06-04 18:15:28,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192898244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:28,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:28,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:15:28,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533839534]
[2024-06-04 18:15:28,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:28,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:15:28,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:28,828 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:15:28,828 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:15:28,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:15:28,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 252 transitions, 3230 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:28,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:28,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:15:28,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:30,330 INFO  L124   PetriNetUnfolderBase]: 2569/3883 cut-off events.
[2024-06-04 18:15:30,330 INFO  L125   PetriNetUnfolderBase]: For 162239/162239 co-relation queries the response was YES.
[2024-06-04 18:15:30,347 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27759 conditions, 3883 events. 2569/3883 cut-off events. For 162239/162239 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 19823 event pairs, 572 based on Foata normal form. 3/3885 useless extension candidates. Maximal degree in co-relation 27664. Up to 3602 conditions per place. 
[2024-06-04 18:15:30,359 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 231 selfloop transitions, 66 changer transitions 0/300 dead transitions.
[2024-06-04 18:15:30,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 300 transitions, 4273 flow
[2024-06-04 18:15:30,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:15:30,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:15:30,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:15:30,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.478125
[2024-06-04 18:15:30,362 INFO  L175             Difference]: Start difference. First operand has 188 places, 252 transitions, 3230 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:15:30,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 300 transitions, 4273 flow
[2024-06-04 18:15:30,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 300 transitions, 4222 flow, removed 20 selfloop flow, removed 2 redundant places.
[2024-06-04 18:15:30,639 INFO  L231             Difference]: Finished difference. Result has 197 places, 264 transitions, 3585 flow
[2024-06-04 18:15:30,639 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3179, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3585, PETRI_PLACES=197, PETRI_TRANSITIONS=264}
[2024-06-04 18:15:30,639 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places.
[2024-06-04 18:15:30,640 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 264 transitions, 3585 flow
[2024-06-04 18:15:30,640 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:30,640 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:30,640 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:30,640 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:15:30,640 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:30,640 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:30,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -964769716, now seen corresponding path program 1 times
[2024-06-04 18:15:30,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:30,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709209020]
[2024-06-04 18:15:30,641 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:30,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:30,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:43,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:43,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:43,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709209020]
[2024-06-04 18:15:43,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709209020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:43,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:43,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:15:43,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601910863]
[2024-06-04 18:15:43,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:43,085 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:15:43,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:43,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:15:43,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:15:43,349 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:15:43,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 264 transitions, 3585 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:43,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:43,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:15:43,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:44,684 INFO  L124   PetriNetUnfolderBase]: 2651/4009 cut-off events.
[2024-06-04 18:15:44,685 INFO  L125   PetriNetUnfolderBase]: For 186002/186002 co-relation queries the response was YES.
[2024-06-04 18:15:44,703 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29324 conditions, 4009 events. 2651/4009 cut-off events. For 186002/186002 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20518 event pairs, 647 based on Foata normal form. 10/4018 useless extension candidates. Maximal degree in co-relation 29224. Up to 3756 conditions per place. 
[2024-06-04 18:15:44,715 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 263 selfloop transitions, 31 changer transitions 0/297 dead transitions.
[2024-06-04 18:15:44,715 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 297 transitions, 4419 flow
[2024-06-04 18:15:44,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:44,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:44,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-04 18:15:44,717 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-04 18:15:44,717 INFO  L175             Difference]: Start difference. First operand has 197 places, 264 transitions, 3585 flow. Second operand 7 states and 128 transitions.
[2024-06-04 18:15:44,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 297 transitions, 4419 flow
[2024-06-04 18:15:44,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 297 transitions, 4332 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-04 18:15:44,958 INFO  L231             Difference]: Finished difference. Result has 201 places, 266 transitions, 3590 flow
[2024-06-04 18:15:44,958 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3498, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3590, PETRI_PLACES=201, PETRI_TRANSITIONS=266}
[2024-06-04 18:15:44,959 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 160 predicate places.
[2024-06-04 18:15:44,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 266 transitions, 3590 flow
[2024-06-04 18:15:44,959 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:44,959 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:44,959 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:44,959 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:15:44,959 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:44,960 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:44,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -964709266, now seen corresponding path program 2 times
[2024-06-04 18:15:44,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:44,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422668065]
[2024-06-04 18:15:44,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:44,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:44,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:57,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:57,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:57,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422668065]
[2024-06-04 18:15:57,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422668065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:57,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:57,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:57,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870474290]
[2024-06-04 18:15:57,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:57,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:57,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:57,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:57,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:57,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:15:57,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 266 transitions, 3590 flow. Second operand  has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:57,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:57,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:15:57,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:59,327 INFO  L124   PetriNetUnfolderBase]: 2703/4089 cut-off events.
[2024-06-04 18:15:59,327 INFO  L125   PetriNetUnfolderBase]: For 198707/198707 co-relation queries the response was YES.
[2024-06-04 18:15:59,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29847 conditions, 4089 events. 2703/4089 cut-off events. For 198707/198707 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 21083 event pairs, 702 based on Foata normal form. 14/4102 useless extension candidates. Maximal degree in co-relation 29746. Up to 3937 conditions per place. 
[2024-06-04 18:15:59,362 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 257 selfloop transitions, 30 changer transitions 0/290 dead transitions.
[2024-06-04 18:15:59,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 290 transitions, 4278 flow
[2024-06-04 18:15:59,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:59,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:59,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 18:15:59,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392857142857143
[2024-06-04 18:15:59,364 INFO  L175             Difference]: Start difference. First operand has 201 places, 266 transitions, 3590 flow. Second operand 7 states and 123 transitions.
[2024-06-04 18:15:59,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 290 transitions, 4278 flow
[2024-06-04 18:15:59,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 290 transitions, 4237 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 18:15:59,689 INFO  L231             Difference]: Finished difference. Result has 205 places, 267 transitions, 3631 flow
[2024-06-04 18:15:59,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3549, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3631, PETRI_PLACES=205, PETRI_TRANSITIONS=267}
[2024-06-04 18:15:59,689 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 164 predicate places.
[2024-06-04 18:15:59,690 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 267 transitions, 3631 flow
[2024-06-04 18:15:59,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:59,690 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:59,690 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:59,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:15:59,690 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:59,704 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:59,704 INFO  L85        PathProgramCache]: Analyzing trace with hash -821913554, now seen corresponding path program 3 times
[2024-06-04 18:15:59,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:59,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496096829]
[2024-06-04 18:15:59,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:59,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:59,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:12,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:12,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:12,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496096829]
[2024-06-04 18:16:12,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496096829] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:12,804 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:12,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:12,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631559283]
[2024-06-04 18:16:12,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:12,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:12,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:12,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:12,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:12,977 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:16:12,977 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 267 transitions, 3631 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:12,977 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:12,977 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:16:12,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:14,370 INFO  L124   PetriNetUnfolderBase]: 2670/4042 cut-off events.
[2024-06-04 18:16:14,370 INFO  L125   PetriNetUnfolderBase]: For 184252/184252 co-relation queries the response was YES.
[2024-06-04 18:16:14,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29062 conditions, 4042 events. 2670/4042 cut-off events. For 184252/184252 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20779 event pairs, 636 based on Foata normal form. 14/4055 useless extension candidates. Maximal degree in co-relation 28959. Up to 3896 conditions per place. 
[2024-06-04 18:16:14,405 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 261 selfloop transitions, 26 changer transitions 0/290 dead transitions.
[2024-06-04 18:16:14,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 290 transitions, 4301 flow
[2024-06-04 18:16:14,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:16:14,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:16:14,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-04 18:16:14,406 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-04 18:16:14,406 INFO  L175             Difference]: Start difference. First operand has 205 places, 267 transitions, 3631 flow. Second operand 6 states and 112 transitions.
[2024-06-04 18:16:14,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 290 transitions, 4301 flow
[2024-06-04 18:16:14,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 290 transitions, 4237 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:14,693 INFO  L231             Difference]: Finished difference. Result has 206 places, 267 transitions, 3629 flow
[2024-06-04 18:16:14,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3567, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3629, PETRI_PLACES=206, PETRI_TRANSITIONS=267}
[2024-06-04 18:16:14,693 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places.
[2024-06-04 18:16:14,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 267 transitions, 3629 flow
[2024-06-04 18:16:14,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:14,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:14,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:14,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:16:14,694 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:14,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:14,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -2057392392, now seen corresponding path program 1 times
[2024-06-04 18:16:14,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:14,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229032141]
[2024-06-04 18:16:14,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:14,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:14,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:24,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:24,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:24,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229032141]
[2024-06-04 18:16:24,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229032141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:24,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:24,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:24,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326963602]
[2024-06-04 18:16:24,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:24,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:24,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:24,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:24,342 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:24,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:16:24,445 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 267 transitions, 3629 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:24,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:24,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:16:24,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:25,884 INFO  L124   PetriNetUnfolderBase]: 2652/4019 cut-off events.
[2024-06-04 18:16:25,885 INFO  L125   PetriNetUnfolderBase]: For 176311/176313 co-relation queries the response was YES.
[2024-06-04 18:16:25,902 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28716 conditions, 4019 events. 2652/4019 cut-off events. For 176311/176313 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20749 event pairs, 603 based on Foata normal form. 8/4026 useless extension candidates. Maximal degree in co-relation 28612. Up to 3402 conditions per place. 
[2024-06-04 18:16:25,915 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 199 selfloop transitions, 97 changer transitions 0/299 dead transitions.
[2024-06-04 18:16:25,915 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 299 transitions, 4427 flow
[2024-06-04 18:16:25,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:25,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:25,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 18:16:25,916 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46875
[2024-06-04 18:16:25,916 INFO  L175             Difference]: Start difference. First operand has 206 places, 267 transitions, 3629 flow. Second operand 8 states and 150 transitions.
[2024-06-04 18:16:25,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 299 transitions, 4427 flow
[2024-06-04 18:16:26,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 299 transitions, 4339 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:26,182 INFO  L231             Difference]: Finished difference. Result has 209 places, 267 transitions, 3744 flow
[2024-06-04 18:16:26,182 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3541, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3744, PETRI_PLACES=209, PETRI_TRANSITIONS=267}
[2024-06-04 18:16:26,183 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places.
[2024-06-04 18:16:26,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 267 transitions, 3744 flow
[2024-06-04 18:16:26,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:26,183 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:26,183 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:26,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:16:26,183 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:26,184 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:26,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 1377370764, now seen corresponding path program 1 times
[2024-06-04 18:16:26,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:26,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632286200]
[2024-06-04 18:16:26,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:26,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:26,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:37,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:37,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:37,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632286200]
[2024-06-04 18:16:37,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632286200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:37,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:37,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:37,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976958918]
[2024-06-04 18:16:37,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:37,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:37,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:37,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:37,747 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:37,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:16:37,915 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 267 transitions, 3744 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:37,915 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:37,915 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:16:37,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:39,547 INFO  L124   PetriNetUnfolderBase]: 2755/4177 cut-off events.
[2024-06-04 18:16:39,548 INFO  L125   PetriNetUnfolderBase]: For 200656/200659 co-relation queries the response was YES.
[2024-06-04 18:16:39,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30302 conditions, 4177 events. 2755/4177 cut-off events. For 200656/200659 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21685 event pairs, 501 based on Foata normal form. 14/4190 useless extension candidates. Maximal degree in co-relation 30197. Up to 3397 conditions per place. 
[2024-06-04 18:16:39,588 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 204 selfloop transitions, 113 changer transitions 0/320 dead transitions.
[2024-06-04 18:16:39,589 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 320 transitions, 5010 flow
[2024-06-04 18:16:39,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:39,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:39,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-04 18:16:39,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-06-04 18:16:39,591 INFO  L175             Difference]: Start difference. First operand has 209 places, 267 transitions, 3744 flow. Second operand 9 states and 176 transitions.
[2024-06-04 18:16:39,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 320 transitions, 5010 flow
[2024-06-04 18:16:39,960 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 320 transitions, 4709 flow, removed 18 selfloop flow, removed 9 redundant places.
[2024-06-04 18:16:39,964 INFO  L231             Difference]: Finished difference. Result has 209 places, 271 transitions, 3734 flow
[2024-06-04 18:16:39,964 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3734, PETRI_PLACES=209, PETRI_TRANSITIONS=271}
[2024-06-04 18:16:39,964 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places.
[2024-06-04 18:16:39,965 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 271 transitions, 3734 flow
[2024-06-04 18:16:39,965 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:39,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:39,965 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:39,966 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:16:39,966 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:39,966 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:39,966 INFO  L85        PathProgramCache]: Analyzing trace with hash -2064804678, now seen corresponding path program 2 times
[2024-06-04 18:16:39,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:39,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22733391]
[2024-06-04 18:16:39,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:39,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:40,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:51,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-04 18:16:51,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:51,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22733391]
[2024-06-04 18:16:51,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22733391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:51,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:51,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:51,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086549780]
[2024-06-04 18:16:51,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:51,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:51,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:51,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:51,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:51,419 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:16:51,419 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 271 transitions, 3734 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:51,419 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:51,419 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:16:51,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:52,938 INFO  L124   PetriNetUnfolderBase]: 2865/4335 cut-off events.
[2024-06-04 18:16:52,938 INFO  L125   PetriNetUnfolderBase]: For 216560/216562 co-relation queries the response was YES.
[2024-06-04 18:16:52,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31627 conditions, 4335 events. 2865/4335 cut-off events. For 216560/216562 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22672 event pairs, 635 based on Foata normal form. 14/4348 useless extension candidates. Maximal degree in co-relation 31523. Up to 3500 conditions per place. 
[2024-06-04 18:16:52,977 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 201 selfloop transitions, 125 changer transitions 0/329 dead transitions.
[2024-06-04 18:16:52,977 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 329 transitions, 4955 flow
[2024-06-04 18:16:52,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:52,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:52,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-04 18:16:52,982 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48055555555555557
[2024-06-04 18:16:52,982 INFO  L175             Difference]: Start difference. First operand has 209 places, 271 transitions, 3734 flow. Second operand 9 states and 173 transitions.
[2024-06-04 18:16:52,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 329 transitions, 4955 flow
[2024-06-04 18:16:53,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 329 transitions, 4836 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-04 18:16:53,345 INFO  L231             Difference]: Finished difference. Result has 216 places, 286 transitions, 4153 flow
[2024-06-04 18:16:53,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3626, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4153, PETRI_PLACES=216, PETRI_TRANSITIONS=286}
[2024-06-04 18:16:53,346 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places.
[2024-06-04 18:16:53,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 286 transitions, 4153 flow
[2024-06-04 18:16:53,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:53,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:53,347 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:53,347 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:16:53,347 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:53,347 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:53,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 1377580293, now seen corresponding path program 1 times
[2024-06-04 18:16:53,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:53,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804406110]
[2024-06-04 18:16:53,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:53,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:53,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:07,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:07,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:07,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804406110]
[2024-06-04 18:17:07,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804406110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:07,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:07,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:07,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975673110]
[2024-06-04 18:17:07,841 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:07,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:07,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:07,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:07,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:08,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:17:08,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 286 transitions, 4153 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:08,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:08,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:17:08,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:09,514 INFO  L124   PetriNetUnfolderBase]: 2943/4443 cut-off events.
[2024-06-04 18:17:09,514 INFO  L125   PetriNetUnfolderBase]: For 230747/230749 co-relation queries the response was YES.
[2024-06-04 18:17:09,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33911 conditions, 4443 events. 2943/4443 cut-off events. For 230747/230749 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23275 event pairs, 633 based on Foata normal form. 8/4450 useless extension candidates. Maximal degree in co-relation 33803. Up to 3583 conditions per place. 
[2024-06-04 18:17:09,553 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 204 selfloop transitions, 127 changer transitions 0/334 dead transitions.
[2024-06-04 18:17:09,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 334 transitions, 5291 flow
[2024-06-04 18:17:09,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:09,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:09,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 18:17:09,555 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-04 18:17:09,555 INFO  L175             Difference]: Start difference. First operand has 216 places, 286 transitions, 4153 flow. Second operand 9 states and 172 transitions.
[2024-06-04 18:17:09,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 334 transitions, 5291 flow
[2024-06-04 18:17:09,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 334 transitions, 5054 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:09,890 INFO  L231             Difference]: Finished difference. Result has 220 places, 294 transitions, 4337 flow
[2024-06-04 18:17:09,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3916, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4337, PETRI_PLACES=220, PETRI_TRANSITIONS=294}
[2024-06-04 18:17:09,891 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places.
[2024-06-04 18:17:09,891 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 294 transitions, 4337 flow
[2024-06-04 18:17:09,891 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:09,891 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:09,891 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:09,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:17:09,892 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:09,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:09,892 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384998903, now seen corresponding path program 2 times
[2024-06-04 18:17:09,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:09,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401733579]
[2024-06-04 18:17:09,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:09,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:09,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:22,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:22,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:22,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401733579]
[2024-06-04 18:17:22,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401733579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:22,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:22,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:22,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976679040]
[2024-06-04 18:17:22,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:22,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:22,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:22,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:22,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:22,214 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:17:22,214 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 294 transitions, 4337 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:22,214 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:22,214 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:17:22,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:23,914 INFO  L124   PetriNetUnfolderBase]: 3077/4629 cut-off events.
[2024-06-04 18:17:23,914 INFO  L125   PetriNetUnfolderBase]: For 254262/254264 co-relation queries the response was YES.
[2024-06-04 18:17:23,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36399 conditions, 4629 events. 3077/4629 cut-off events. For 254262/254264 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24271 event pairs, 617 based on Foata normal form. 8/4636 useless extension candidates. Maximal degree in co-relation 36290. Up to 3827 conditions per place. 
[2024-06-04 18:17:23,951 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 232 selfloop transitions, 121 changer transitions 0/356 dead transitions.
[2024-06-04 18:17:23,951 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 356 transitions, 5767 flow
[2024-06-04 18:17:23,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:23,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:23,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-04 18:17:23,953 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-04 18:17:23,953 INFO  L175             Difference]: Start difference. First operand has 220 places, 294 transitions, 4337 flow. Second operand 9 states and 165 transitions.
[2024-06-04 18:17:23,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 356 transitions, 5767 flow
[2024-06-04 18:17:24,409 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 356 transitions, 5549 flow, removed 42 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:24,414 INFO  L231             Difference]: Finished difference. Result has 227 places, 320 transitions, 4959 flow
[2024-06-04 18:17:24,414 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4119, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4959, PETRI_PLACES=227, PETRI_TRANSITIONS=320}
[2024-06-04 18:17:24,414 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places.
[2024-06-04 18:17:24,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 320 transitions, 4959 flow
[2024-06-04 18:17:24,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:24,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:24,415 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:24,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:17:24,415 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:24,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:24,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 703947461, now seen corresponding path program 3 times
[2024-06-04 18:17:24,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:24,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837080597]
[2024-06-04 18:17:24,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:24,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:24,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:36,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:36,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:36,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837080597]
[2024-06-04 18:17:36,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837080597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:36,848 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:36,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:36,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519326786]
[2024-06-04 18:17:36,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:36,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:36,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:36,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:36,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:37,057 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:17:37,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 320 transitions, 4959 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:37,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:37,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:17:37,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:38,857 INFO  L124   PetriNetUnfolderBase]: 3169/4758 cut-off events.
[2024-06-04 18:17:38,857 INFO  L125   PetriNetUnfolderBase]: For 279886/279889 co-relation queries the response was YES.
[2024-06-04 18:17:38,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39796 conditions, 4758 events. 3169/4758 cut-off events. For 279886/279889 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 24946 event pairs, 622 based on Foata normal form. 10/4767 useless extension candidates. Maximal degree in co-relation 39682. Up to 3704 conditions per place. 
[2024-06-04 18:17:38,898 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 200 selfloop transitions, 181 changer transitions 0/384 dead transitions.
[2024-06-04 18:17:38,898 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 384 transitions, 6779 flow
[2024-06-04 18:17:38,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:38,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:38,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 18:17:38,900 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-04 18:17:38,900 INFO  L175             Difference]: Start difference. First operand has 227 places, 320 transitions, 4959 flow. Second operand 9 states and 172 transitions.
[2024-06-04 18:17:38,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 384 transitions, 6779 flow
[2024-06-04 18:17:39,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 384 transitions, 6698 flow, removed 33 selfloop flow, removed 3 redundant places.
[2024-06-04 18:17:39,339 INFO  L231             Difference]: Finished difference. Result has 235 places, 344 transitions, 5887 flow
[2024-06-04 18:17:39,339 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4878, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5887, PETRI_PLACES=235, PETRI_TRANSITIONS=344}
[2024-06-04 18:17:39,340 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 194 predicate places.
[2024-06-04 18:17:39,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 344 transitions, 5887 flow
[2024-06-04 18:17:39,340 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:39,340 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:39,340 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:39,340 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:17:39,340 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:39,341 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:39,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -2057395368, now seen corresponding path program 3 times
[2024-06-04 18:17:39,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:39,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022173210]
[2024-06-04 18:17:39,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:39,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:39,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:50,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:50,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:50,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022173210]
[2024-06-04 18:17:50,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022173210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:50,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:50,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:50,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636127513]
[2024-06-04 18:17:50,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:50,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:50,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:50,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:50,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:50,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:17:50,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 344 transitions, 5887 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:50,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:50,608 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:17:50,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:52,419 INFO  L124   PetriNetUnfolderBase]: 3389/5109 cut-off events.
[2024-06-04 18:17:52,420 INFO  L125   PetriNetUnfolderBase]: For 375622/375624 co-relation queries the response was YES.
[2024-06-04 18:17:52,462 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43750 conditions, 5109 events. 3389/5109 cut-off events. For 375622/375624 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 27070 event pairs, 704 based on Foata normal form. 68/5176 useless extension candidates. Maximal degree in co-relation 43631. Up to 4119 conditions per place. 
[2024-06-04 18:17:52,486 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 276 selfloop transitions, 107 changer transitions 1/387 dead transitions.
[2024-06-04 18:17:52,486 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 387 transitions, 7025 flow
[2024-06-04 18:17:52,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:52,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:52,487 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 18:17:52,487 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-04 18:17:52,487 INFO  L175             Difference]: Start difference. First operand has 235 places, 344 transitions, 5887 flow. Second operand 9 states and 170 transitions.
[2024-06-04 18:17:52,488 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 387 transitions, 7025 flow
[2024-06-04 18:17:52,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 387 transitions, 6785 flow, removed 106 selfloop flow, removed 2 redundant places.
[2024-06-04 18:17:52,912 INFO  L231             Difference]: Finished difference. Result has 242 places, 346 transitions, 5932 flow
[2024-06-04 18:17:52,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5655, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5932, PETRI_PLACES=242, PETRI_TRANSITIONS=346}
[2024-06-04 18:17:52,912 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places.
[2024-06-04 18:17:52,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 346 transitions, 5932 flow
[2024-06-04 18:17:52,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:52,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:52,913 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:52,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:17:52,913 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:52,914 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:52,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 1495790640, now seen corresponding path program 2 times
[2024-06-04 18:17:52,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:52,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557103983]
[2024-06-04 18:17:52,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:52,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:52,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:03,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:03,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:03,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557103983]
[2024-06-04 18:18:03,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557103983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:03,023 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:03,023 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:03,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375776287]
[2024-06-04 18:18:03,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:03,023 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:03,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:03,024 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:03,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:03,120 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:18:03,121 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 346 transitions, 5932 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:03,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:03,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:18:03,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:04,936 INFO  L124   PetriNetUnfolderBase]: 3399/5123 cut-off events.
[2024-06-04 18:18:04,936 INFO  L125   PetriNetUnfolderBase]: For 302505/302507 co-relation queries the response was YES.
[2024-06-04 18:18:04,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43589 conditions, 5123 events. 3399/5123 cut-off events. For 302505/302507 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 27234 event pairs, 719 based on Foata normal form. 8/5130 useless extension candidates. Maximal degree in co-relation 43468. Up to 4486 conditions per place. 
[2024-06-04 18:18:04,986 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 285 selfloop transitions, 95 changer transitions 0/383 dead transitions.
[2024-06-04 18:18:04,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 383 transitions, 7111 flow
[2024-06-04 18:18:04,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:18:04,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:18:04,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-04 18:18:04,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.459375
[2024-06-04 18:18:04,996 INFO  L175             Difference]: Start difference. First operand has 242 places, 346 transitions, 5932 flow. Second operand 8 states and 147 transitions.
[2024-06-04 18:18:04,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 383 transitions, 7111 flow
[2024-06-04 18:18:05,535 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 383 transitions, 6878 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:05,540 INFO  L231             Difference]: Finished difference. Result has 243 places, 351 transitions, 6043 flow
[2024-06-04 18:18:05,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5709, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6043, PETRI_PLACES=243, PETRI_TRANSITIONS=351}
[2024-06-04 18:18:05,541 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places.
[2024-06-04 18:18:05,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 351 transitions, 6043 flow
[2024-06-04 18:18:05,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:05,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:05,541 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:05,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:18:05,541 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:05,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:05,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 1643615907, now seen corresponding path program 1 times
[2024-06-04 18:18:05,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:05,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555673915]
[2024-06-04 18:18:05,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:05,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:05,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:16,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:16,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:16,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555673915]
[2024-06-04 18:18:16,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555673915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:16,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:16,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:16,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343021568]
[2024-06-04 18:18:16,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:16,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:16,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:16,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:16,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:16,629 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:18:16,630 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 351 transitions, 6043 flow. Second operand  has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:16,630 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:16,630 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:18:16,630 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:18,201 INFO  L124   PetriNetUnfolderBase]: 3407/5134 cut-off events.
[2024-06-04 18:18:18,201 INFO  L125   PetriNetUnfolderBase]: For 305598/305598 co-relation queries the response was YES.
[2024-06-04 18:18:18,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43685 conditions, 5134 events. 3407/5134 cut-off events. For 305598/305598 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27259 event pairs, 897 based on Foata normal form. 2/5135 useless extension candidates. Maximal degree in co-relation 43563. Up to 5079 conditions per place. 
[2024-06-04 18:18:18,253 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 345 selfloop transitions, 24 changer transitions 0/372 dead transitions.
[2024-06-04 18:18:18,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 372 transitions, 6875 flow
[2024-06-04 18:18:18,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:18:18,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:18:18,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-04 18:18:18,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:18:18,255 INFO  L175             Difference]: Start difference. First operand has 243 places, 351 transitions, 6043 flow. Second operand 8 states and 128 transitions.
[2024-06-04 18:18:18,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 372 transitions, 6875 flow
[2024-06-04 18:18:18,719 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 372 transitions, 6683 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-04 18:18:18,724 INFO  L231             Difference]: Finished difference. Result has 246 places, 353 transitions, 5950 flow
[2024-06-04 18:18:18,725 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5851, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5950, PETRI_PLACES=246, PETRI_TRANSITIONS=353}
[2024-06-04 18:18:18,726 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places.
[2024-06-04 18:18:18,726 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 353 transitions, 5950 flow
[2024-06-04 18:18:18,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:18,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:18,727 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:18,727 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:18:18,727 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:18,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:18,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 1643604003, now seen corresponding path program 4 times
[2024-06-04 18:18:18,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:18,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329770678]
[2024-06-04 18:18:18,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:18,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:18,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:30,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:30,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:30,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329770678]
[2024-06-04 18:18:30,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329770678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:30,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:30,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:30,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423715843]
[2024-06-04 18:18:30,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:30,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:30,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:30,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:30,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:18:30,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:18:30,675 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 353 transitions, 5950 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:30,675 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:30,675 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:18:30,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:32,508 INFO  L124   PetriNetUnfolderBase]: 3467/5218 cut-off events.
[2024-06-04 18:18:32,508 INFO  L125   PetriNetUnfolderBase]: For 323942/323942 co-relation queries the response was YES.
[2024-06-04 18:18:32,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44097 conditions, 5218 events. 3467/5218 cut-off events. For 323942/323942 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 27735 event pairs, 878 based on Foata normal form. 6/5223 useless extension candidates. Maximal degree in co-relation 43974. Up to 5015 conditions per place. 
[2024-06-04 18:18:32,557 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 341 selfloop transitions, 48 changer transitions 0/392 dead transitions.
[2024-06-04 18:18:32,557 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 392 transitions, 6998 flow
[2024-06-04 18:18:32,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:18:32,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:18:32,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions.
[2024-06-04 18:18:32,558 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40454545454545454
[2024-06-04 18:18:32,559 INFO  L175             Difference]: Start difference. First operand has 246 places, 353 transitions, 5950 flow. Second operand 11 states and 178 transitions.
[2024-06-04 18:18:32,559 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 392 transitions, 6998 flow
[2024-06-04 18:18:33,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 392 transitions, 6905 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:33,057 INFO  L231             Difference]: Finished difference. Result has 253 places, 364 transitions, 6168 flow
[2024-06-04 18:18:33,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5857, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6168, PETRI_PLACES=253, PETRI_TRANSITIONS=364}
[2024-06-04 18:18:33,058 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places.
[2024-06-04 18:18:33,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 364 transitions, 6168 flow
[2024-06-04 18:18:33,058 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:33,058 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:33,058 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:33,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:18:33,058 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:33,059 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:33,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 1643277294, now seen corresponding path program 4 times
[2024-06-04 18:18:33,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:33,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091288390]
[2024-06-04 18:18:33,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:33,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:33,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:44,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:44,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:44,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091288390]
[2024-06-04 18:18:44,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091288390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:44,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:44,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:44,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589710916]
[2024-06-04 18:18:44,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:44,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:44,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:44,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:44,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:18:44,746 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:18:44,746 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 364 transitions, 6168 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:44,746 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:44,746 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:18:44,746 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:46,675 INFO  L124   PetriNetUnfolderBase]: 3511/5286 cut-off events.
[2024-06-04 18:18:46,675 INFO  L125   PetriNetUnfolderBase]: For 344012/344012 co-relation queries the response was YES.
[2024-06-04 18:18:46,706 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44896 conditions, 5286 events. 3511/5286 cut-off events. For 344012/344012 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 28188 event pairs, 930 based on Foata normal form. 12/5297 useless extension candidates. Maximal degree in co-relation 44770. Up to 5167 conditions per place. 
[2024-06-04 18:18:46,723 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 358 selfloop transitions, 31 changer transitions 0/392 dead transitions.
[2024-06-04 18:18:46,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 392 transitions, 7116 flow
[2024-06-04 18:18:46,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:18:46,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:18:46,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions.
[2024-06-04 18:18:46,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3975
[2024-06-04 18:18:46,725 INFO  L175             Difference]: Start difference. First operand has 253 places, 364 transitions, 6168 flow. Second operand 10 states and 159 transitions.
[2024-06-04 18:18:46,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 392 transitions, 7116 flow
[2024-06-04 18:18:47,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 392 transitions, 7002 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-04 18:18:47,264 INFO  L231             Difference]: Finished difference. Result has 258 places, 366 transitions, 6164 flow
[2024-06-04 18:18:47,264 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6054, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6164, PETRI_PLACES=258, PETRI_TRANSITIONS=366}
[2024-06-04 18:18:47,264 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places.
[2024-06-04 18:18:47,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 366 transitions, 6164 flow
[2024-06-04 18:18:47,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:47,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:47,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:47,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:18:47,265 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:47,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:47,266 INFO  L85        PathProgramCache]: Analyzing trace with hash -1799107119, now seen corresponding path program 5 times
[2024-06-04 18:18:47,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:47,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613281617]
[2024-06-04 18:18:47,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:47,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:47,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:57,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:57,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:57,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613281617]
[2024-06-04 18:18:57,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613281617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:57,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:57,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:57,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35516903]
[2024-06-04 18:18:57,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:57,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:57,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:57,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:57,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:18:57,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:18:57,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 366 transitions, 6164 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:57,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:57,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:18:57,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:59,567 INFO  L124   PetriNetUnfolderBase]: 3589/5394 cut-off events.
[2024-06-04 18:18:59,567 INFO  L125   PetriNetUnfolderBase]: For 356300/356300 co-relation queries the response was YES.
[2024-06-04 18:18:59,603 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46091 conditions, 5394 events. 3589/5394 cut-off events. For 356300/356300 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28794 event pairs, 904 based on Foata normal form. 6/5399 useless extension candidates. Maximal degree in co-relation 45963. Up to 5128 conditions per place. 
[2024-06-04 18:18:59,623 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 345 selfloop transitions, 55 changer transitions 0/403 dead transitions.
[2024-06-04 18:18:59,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 403 transitions, 7348 flow
[2024-06-04 18:18:59,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:18:59,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:18:59,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions.
[2024-06-04 18:18:59,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4225
[2024-06-04 18:18:59,625 INFO  L175             Difference]: Start difference. First operand has 258 places, 366 transitions, 6164 flow. Second operand 10 states and 169 transitions.
[2024-06-04 18:18:59,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 403 transitions, 7348 flow
[2024-06-04 18:19:00,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 403 transitions, 7276 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-04 18:19:00,204 INFO  L231             Difference]: Finished difference. Result has 262 places, 374 transitions, 6400 flow
[2024-06-04 18:19:00,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6092, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6400, PETRI_PLACES=262, PETRI_TRANSITIONS=374}
[2024-06-04 18:19:00,204 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places.
[2024-06-04 18:19:00,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 374 transitions, 6400 flow
[2024-06-04 18:19:00,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:00,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:00,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:00,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:19:00,205 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:00,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:00,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1799097819, now seen corresponding path program 6 times
[2024-06-04 18:19:00,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:00,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595031450]
[2024-06-04 18:19:00,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:00,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:00,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:11,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:11,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:11,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595031450]
[2024-06-04 18:19:11,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595031450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:11,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:11,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:11,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643222108]
[2024-06-04 18:19:11,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:11,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:11,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:11,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:11,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:11,331 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:19:11,351 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 374 transitions, 6400 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:11,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:11,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:19:11,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:13,197 INFO  L124   PetriNetUnfolderBase]: 3571/5370 cut-off events.
[2024-06-04 18:19:13,197 INFO  L125   PetriNetUnfolderBase]: For 357915/357915 co-relation queries the response was YES.
[2024-06-04 18:19:13,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46000 conditions, 5370 events. 3571/5370 cut-off events. For 357915/357915 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 28704 event pairs, 906 based on Foata normal form. 6/5375 useless extension candidates. Maximal degree in co-relation 45870. Up to 5176 conditions per place. 
[2024-06-04 18:19:13,239 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 355 selfloop transitions, 44 changer transitions 0/402 dead transitions.
[2024-06-04 18:19:13,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 402 transitions, 7308 flow
[2024-06-04 18:19:13,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:13,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:13,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-04 18:19:13,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175
[2024-06-04 18:19:13,241 INFO  L175             Difference]: Start difference. First operand has 262 places, 374 transitions, 6400 flow. Second operand 10 states and 167 transitions.
[2024-06-04 18:19:13,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 402 transitions, 7308 flow
[2024-06-04 18:19:13,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 402 transitions, 7114 flow, removed 52 selfloop flow, removed 7 redundant places.
[2024-06-04 18:19:13,693 INFO  L231             Difference]: Finished difference. Result has 265 places, 374 transitions, 6301 flow
[2024-06-04 18:19:13,708 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6206, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6301, PETRI_PLACES=265, PETRI_TRANSITIONS=374}
[2024-06-04 18:19:13,709 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 224 predicate places.
[2024-06-04 18:19:13,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 374 transitions, 6301 flow
[2024-06-04 18:19:13,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:13,709 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:13,709 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:13,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:19:13,709 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-04 18:19:13,709 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:13,710 INFO  L85        PathProgramCache]: Analyzing trace with hash -1774788832, now seen corresponding path program 1 times
[2024-06-04 18:19:13,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:13,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622826132]
[2024-06-04 18:19:13,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:13,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:13,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:23,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:23,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:23,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622826132]
[2024-06-04 18:19:23,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622826132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:23,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:23,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:23,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800829683]
[2024-06-04 18:19:23,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:23,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:23,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:23,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:23,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:23,217 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:19:23,217 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 374 transitions, 6301 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:23,218 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:23,218 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:19:23,218 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:24,912 INFO  L124   PetriNetUnfolderBase]: 3602/5413 cut-off events.
[2024-06-04 18:19:24,912 INFO  L125   PetriNetUnfolderBase]: For 367763/367763 co-relation queries the response was YES.
[2024-06-04 18:19:24,939 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46424 conditions, 5413 events. 3602/5413 cut-off events. For 367763/367763 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 28965 event pairs, 935 based on Foata normal form. 3/5415 useless extension candidates. Maximal degree in co-relation 46293. Up to 5240 conditions per place. 
[2024-06-04 18:19:24,954 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 349 selfloop transitions, 54 changer transitions 0/406 dead transitions.
[2024-06-04 18:19:24,955 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 406 transitions, 7546 flow
[2024-06-04 18:19:24,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:19:24,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:19:24,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 18:19:24,956 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-04 18:19:24,956 INFO  L175             Difference]: Start difference. First operand has 265 places, 374 transitions, 6301 flow. Second operand 7 states and 122 transitions.
[2024-06-04 18:19:24,956 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 406 transitions, 7546 flow
[2024-06-04 18:19:25,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 406 transitions, 7408 flow, removed 12 selfloop flow, removed 10 redundant places.
[2024-06-04 18:19:25,388 INFO  L231             Difference]: Finished difference. Result has 262 places, 382 transitions, 6485 flow
[2024-06-04 18:19:25,388 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6163, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6485, PETRI_PLACES=262, PETRI_TRANSITIONS=382}
[2024-06-04 18:19:25,389 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places.
[2024-06-04 18:19:25,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 382 transitions, 6485 flow
[2024-06-04 18:19:25,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:25,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:25,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:25,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:19:25,389 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:25,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:25,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 158776166, now seen corresponding path program 2 times
[2024-06-04 18:19:25,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:25,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512353252]
[2024-06-04 18:19:25,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:25,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:25,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:35,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:35,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:35,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512353252]
[2024-06-04 18:19:35,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512353252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:35,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:35,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:35,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792579670]
[2024-06-04 18:19:35,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:35,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:35,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:35,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:35,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:35,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:19:35,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 382 transitions, 6485 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:35,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:35,330 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:19:35,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:37,363 INFO  L124   PetriNetUnfolderBase]: 3609/5423 cut-off events.
[2024-06-04 18:19:37,363 INFO  L125   PetriNetUnfolderBase]: For 376061/376061 co-relation queries the response was YES.
[2024-06-04 18:19:37,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46584 conditions, 5423 events. 3609/5423 cut-off events. For 376061/376061 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 28987 event pairs, 952 based on Foata normal form. 3/5425 useless extension candidates. Maximal degree in co-relation 46453. Up to 5344 conditions per place. 
[2024-06-04 18:19:37,411 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 365 selfloop transitions, 33 changer transitions 0/401 dead transitions.
[2024-06-04 18:19:37,411 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 401 transitions, 7431 flow
[2024-06-04 18:19:37,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:19:37,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:19:37,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-04 18:19:37,412 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-04 18:19:37,412 INFO  L175             Difference]: Start difference. First operand has 262 places, 382 transitions, 6485 flow. Second operand 7 states and 115 transitions.
[2024-06-04 18:19:37,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 401 transitions, 7431 flow
[2024-06-04 18:19:38,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 401 transitions, 7334 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-06-04 18:19:38,005 INFO  L231             Difference]: Finished difference. Result has 265 places, 385 transitions, 6551 flow
[2024-06-04 18:19:38,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6388, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6551, PETRI_PLACES=265, PETRI_TRANSITIONS=385}
[2024-06-04 18:19:38,006 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 224 predicate places.
[2024-06-04 18:19:38,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 385 transitions, 6551 flow
[2024-06-04 18:19:38,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:38,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:38,006 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:38,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:19:38,006 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:38,007 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:38,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -1780954918, now seen corresponding path program 3 times
[2024-06-04 18:19:38,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:38,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401829748]
[2024-06-04 18:19:38,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:38,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:38,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:47,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:47,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:47,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401829748]
[2024-06-04 18:19:47,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401829748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:47,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:47,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:47,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525795962]
[2024-06-04 18:19:47,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:47,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:47,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:47,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:47,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:47,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:19:47,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 385 transitions, 6551 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:47,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:47,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:19:47,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:49,628 INFO  L124   PetriNetUnfolderBase]: 3639/5465 cut-off events.
[2024-06-04 18:19:49,629 INFO  L125   PetriNetUnfolderBase]: For 383415/383415 co-relation queries the response was YES.
[2024-06-04 18:19:49,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47057 conditions, 5465 events. 3639/5465 cut-off events. For 383415/383415 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 29226 event pairs, 938 based on Foata normal form. 6/5470 useless extension candidates. Maximal degree in co-relation 46926. Up to 5316 conditions per place. 
[2024-06-04 18:19:49,673 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 374 selfloop transitions, 39 changer transitions 0/416 dead transitions.
[2024-06-04 18:19:49,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 416 transitions, 7661 flow
[2024-06-04 18:19:49,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:19:49,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:19:49,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:19:49,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.421875
[2024-06-04 18:19:49,674 INFO  L175             Difference]: Start difference. First operand has 265 places, 385 transitions, 6551 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:19:49,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 416 transitions, 7661 flow
[2024-06-04 18:19:50,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 416 transitions, 7515 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-04 18:19:50,218 INFO  L231             Difference]: Finished difference. Result has 266 places, 390 transitions, 6642 flow
[2024-06-04 18:19:50,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6405, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6642, PETRI_PLACES=266, PETRI_TRANSITIONS=390}
[2024-06-04 18:19:50,218 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places.
[2024-06-04 18:19:50,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 390 transitions, 6642 flow
[2024-06-04 18:19:50,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:50,219 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:50,219 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:50,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:19:50,219 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:50,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:50,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693489367, now seen corresponding path program 1 times
[2024-06-04 18:19:50,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:50,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243287103]
[2024-06-04 18:19:50,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:50,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:50,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:59,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:59,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:59,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243287103]
[2024-06-04 18:19:59,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243287103] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:59,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:59,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:59,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94123322]
[2024-06-04 18:19:59,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:59,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:59,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:59,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:59,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:59,496 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:19:59,496 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 390 transitions, 6642 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:59,496 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:59,496 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:19:59,496 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:01,244 INFO  L124   PetriNetUnfolderBase]: 3629/5452 cut-off events.
[2024-06-04 18:20:01,244 INFO  L125   PetriNetUnfolderBase]: For 375229/375229 co-relation queries the response was YES.
[2024-06-04 18:20:01,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46636 conditions, 5452 events. 3629/5452 cut-off events. For 375229/375229 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 29185 event pairs, 949 based on Foata normal form. 6/5457 useless extension candidates. Maximal degree in co-relation 46506. Up to 5379 conditions per place. 
[2024-06-04 18:20:01,289 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 373 selfloop transitions, 36 changer transitions 0/412 dead transitions.
[2024-06-04 18:20:01,290 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 412 transitions, 7624 flow
[2024-06-04 18:20:01,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:01,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:01,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-04 18:20:01,291 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.403125
[2024-06-04 18:20:01,291 INFO  L175             Difference]: Start difference. First operand has 266 places, 390 transitions, 6642 flow. Second operand 8 states and 129 transitions.
[2024-06-04 18:20:01,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 412 transitions, 7624 flow
[2024-06-04 18:20:01,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 412 transitions, 7434 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-04 18:20:01,886 INFO  L231             Difference]: Finished difference. Result has 268 places, 396 transitions, 6663 flow
[2024-06-04 18:20:01,886 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6452, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6663, PETRI_PLACES=268, PETRI_TRANSITIONS=396}
[2024-06-04 18:20:01,886 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 227 predicate places.
[2024-06-04 18:20:01,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 396 transitions, 6663 flow
[2024-06-04 18:20:01,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:01,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:01,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:01,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 18:20:01,887 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:01,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:01,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 245230640, now seen corresponding path program 4 times
[2024-06-04 18:20:01,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:01,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607719278]
[2024-06-04 18:20:01,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:01,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:01,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:10,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:10,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:10,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607719278]
[2024-06-04 18:20:10,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607719278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:10,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:10,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:10,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118268828]
[2024-06-04 18:20:10,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:10,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:10,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:10,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:10,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:10,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:20:10,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 396 transitions, 6663 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:10,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:10,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:20:10,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:12,410 INFO  L124   PetriNetUnfolderBase]: 3611/5428 cut-off events.
[2024-06-04 18:20:12,410 INFO  L125   PetriNetUnfolderBase]: For 373260/373260 co-relation queries the response was YES.
[2024-06-04 18:20:12,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46426 conditions, 5428 events. 3611/5428 cut-off events. For 373260/373260 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 29090 event pairs, 939 based on Foata normal form. 6/5433 useless extension candidates. Maximal degree in co-relation 46294. Up to 5343 conditions per place. 
[2024-06-04 18:20:12,462 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 385 selfloop transitions, 27 changer transitions 0/415 dead transitions.
[2024-06-04 18:20:12,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 415 transitions, 7580 flow
[2024-06-04 18:20:12,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:12,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:12,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-04 18:20:12,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:20:12,463 INFO  L175             Difference]: Start difference. First operand has 268 places, 396 transitions, 6663 flow. Second operand 8 states and 128 transitions.
[2024-06-04 18:20:12,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 415 transitions, 7580 flow
[2024-06-04 18:20:12,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 415 transitions, 7364 flow, removed 79 selfloop flow, removed 5 redundant places.
[2024-06-04 18:20:12,995 INFO  L231             Difference]: Finished difference. Result has 271 places, 396 transitions, 6510 flow
[2024-06-04 18:20:12,995 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6447, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6510, PETRI_PLACES=271, PETRI_TRANSITIONS=396}
[2024-06-04 18:20:12,996 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 230 predicate places.
[2024-06-04 18:20:12,996 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 396 transitions, 6510 flow
[2024-06-04 18:20:12,996 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:12,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:12,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:12,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 18:20:12,996 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:12,997 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:12,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 290624897, now seen corresponding path program 2 times
[2024-06-04 18:20:12,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:12,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400908786]
[2024-06-04 18:20:12,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:12,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:13,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:22,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:22,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:22,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400908786]
[2024-06-04 18:20:22,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400908786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:22,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:22,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:22,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273014477]
[2024-06-04 18:20:22,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:22,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:22,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:22,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:22,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:22,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:20:22,556 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 396 transitions, 6510 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:22,556 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:22,556 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:20:22,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:24,236 INFO  L124   PetriNetUnfolderBase]: 3651/5484 cut-off events.
[2024-06-04 18:20:24,236 INFO  L125   PetriNetUnfolderBase]: For 384762/384762 co-relation queries the response was YES.
[2024-06-04 18:20:24,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46854 conditions, 5484 events. 3651/5484 cut-off events. For 384762/384762 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 29356 event pairs, 949 based on Foata normal form. 6/5489 useless extension candidates. Maximal degree in co-relation 46721. Up to 5416 conditions per place. 
[2024-06-04 18:20:24,291 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 386 selfloop transitions, 34 changer transitions 0/423 dead transitions.
[2024-06-04 18:20:24,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 423 transitions, 7636 flow
[2024-06-04 18:20:24,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:20:24,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:20:24,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:20:24,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-04 18:20:24,293 INFO  L175             Difference]: Start difference. First operand has 271 places, 396 transitions, 6510 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:20:24,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 423 transitions, 7636 flow
[2024-06-04 18:20:24,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 423 transitions, 7361 flow, removed 53 selfloop flow, removed 8 redundant places.
[2024-06-04 18:20:24,866 INFO  L231             Difference]: Finished difference. Result has 270 places, 407 transitions, 6551 flow
[2024-06-04 18:20:24,866 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6243, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6551, PETRI_PLACES=270, PETRI_TRANSITIONS=407}
[2024-06-04 18:20:24,867 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places.
[2024-06-04 18:20:24,867 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 407 transitions, 6551 flow
[2024-06-04 18:20:24,867 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:24,867 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:24,867 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:24,867 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 18:20:24,867 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:24,868 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:24,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -1625410425, now seen corresponding path program 3 times
[2024-06-04 18:20:24,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:24,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228449760]
[2024-06-04 18:20:24,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:24,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:24,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:33,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-04 18:20:33,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:33,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228449760]
[2024-06-04 18:20:33,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228449760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:33,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:33,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:33,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69716183]
[2024-06-04 18:20:33,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:33,728 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:33,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:33,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:33,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:33,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:20:33,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 407 transitions, 6551 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:33,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:33,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:20:33,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:35,618 INFO  L124   PetriNetUnfolderBase]: 3663/5502 cut-off events.
[2024-06-04 18:20:35,619 INFO  L125   PetriNetUnfolderBase]: For 382527/382527 co-relation queries the response was YES.
[2024-06-04 18:20:35,651 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46214 conditions, 5502 events. 3663/5502 cut-off events. For 382527/382527 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 29576 event pairs, 770 based on Foata normal form. 12/5513 useless extension candidates. Maximal degree in co-relation 46080. Up to 5019 conditions per place. 
[2024-06-04 18:20:35,668 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 351 selfloop transitions, 87 changer transitions 0/441 dead transitions.
[2024-06-04 18:20:35,668 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 441 transitions, 7811 flow
[2024-06-04 18:20:35,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:20:35,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:20:35,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 18:20:35,669 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-04 18:20:35,670 INFO  L175             Difference]: Start difference. First operand has 270 places, 407 transitions, 6551 flow. Second operand 7 states and 135 transitions.
[2024-06-04 18:20:35,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 441 transitions, 7811 flow
[2024-06-04 18:20:36,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 441 transitions, 7631 flow, removed 51 selfloop flow, removed 5 redundant places.
[2024-06-04 18:20:36,302 INFO  L231             Difference]: Finished difference. Result has 272 places, 413 transitions, 6732 flow
[2024-06-04 18:20:36,302 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6373, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6732, PETRI_PLACES=272, PETRI_TRANSITIONS=413}
[2024-06-04 18:20:36,302 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places.
[2024-06-04 18:20:36,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 413 transitions, 6732 flow
[2024-06-04 18:20:36,303 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:36,303 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:36,303 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:36,303 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 18:20:36,303 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:36,303 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:36,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 290475942, now seen corresponding path program 3 times
[2024-06-04 18:20:36,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:36,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130462832]
[2024-06-04 18:20:36,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:36,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:36,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:45,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:45,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:45,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130462832]
[2024-06-04 18:20:45,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130462832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:45,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:45,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:45,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838233782]
[2024-06-04 18:20:45,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:45,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:45,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:45,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:45,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:45,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:20:45,472 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 413 transitions, 6732 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:45,472 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:45,472 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:20:45,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:47,192 INFO  L124   PetriNetUnfolderBase]: 3654/5490 cut-off events.
[2024-06-04 18:20:47,192 INFO  L125   PetriNetUnfolderBase]: For 361204/361204 co-relation queries the response was YES.
[2024-06-04 18:20:47,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46116 conditions, 5490 events. 3654/5490 cut-off events. For 361204/361204 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 29450 event pairs, 947 based on Foata normal form. 3/5492 useless extension candidates. Maximal degree in co-relation 45982. Up to 5392 conditions per place. 
[2024-06-04 18:20:47,239 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 393 selfloop transitions, 34 changer transitions 0/430 dead transitions.
[2024-06-04 18:20:47,240 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 430 transitions, 7653 flow
[2024-06-04 18:20:47,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:20:47,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:20:47,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-04 18:20:47,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-04 18:20:47,241 INFO  L175             Difference]: Start difference. First operand has 272 places, 413 transitions, 6732 flow. Second operand 6 states and 106 transitions.
[2024-06-04 18:20:47,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 430 transitions, 7653 flow
[2024-06-04 18:20:47,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 430 transitions, 7458 flow, removed 45 selfloop flow, removed 5 redundant places.
[2024-06-04 18:20:47,883 INFO  L231             Difference]: Finished difference. Result has 273 places, 413 transitions, 6627 flow
[2024-06-04 18:20:47,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6537, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6627, PETRI_PLACES=273, PETRI_TRANSITIONS=413}
[2024-06-04 18:20:47,884 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places.
[2024-06-04 18:20:47,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 413 transitions, 6627 flow
[2024-06-04 18:20:47,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:47,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:47,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:47,884 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 18:20:47,884 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:47,884 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:47,885 INFO  L85        PathProgramCache]: Analyzing trace with hash 489926687, now seen corresponding path program 4 times
[2024-06-04 18:20:47,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:47,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802517656]
[2024-06-04 18:20:47,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:47,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:47,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:56,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:56,315 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:56,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802517656]
[2024-06-04 18:20:56,315 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802517656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:56,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:56,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:56,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209502067]
[2024-06-04 18:20:56,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:56,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:56,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:56,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:56,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:56,495 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:20:56,495 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 413 transitions, 6627 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:56,495 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:56,495 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:20:56,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:58,125 INFO  L124   PetriNetUnfolderBase]: 3624/5448 cut-off events.
[2024-06-04 18:20:58,126 INFO  L125   PetriNetUnfolderBase]: For 354715/354715 co-relation queries the response was YES.
[2024-06-04 18:20:58,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44926 conditions, 5448 events. 3624/5448 cut-off events. For 354715/354715 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 29195 event pairs, 925 based on Foata normal form. 6/5453 useless extension candidates. Maximal degree in co-relation 44792. Up to 5320 conditions per place. 
[2024-06-04 18:20:58,175 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 381 selfloop transitions, 47 changer transitions 0/431 dead transitions.
[2024-06-04 18:20:58,176 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 431 transitions, 7557 flow
[2024-06-04 18:20:58,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:20:58,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:20:58,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-04 18:20:58,177 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45416666666666666
[2024-06-04 18:20:58,177 INFO  L175             Difference]: Start difference. First operand has 273 places, 413 transitions, 6627 flow. Second operand 6 states and 109 transitions.
[2024-06-04 18:20:58,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 431 transitions, 7557 flow
[2024-06-04 18:20:58,679 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 431 transitions, 7425 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-04 18:20:58,684 INFO  L231             Difference]: Finished difference. Result has 272 places, 413 transitions, 6617 flow
[2024-06-04 18:20:58,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6495, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6617, PETRI_PLACES=272, PETRI_TRANSITIONS=413}
[2024-06-04 18:20:58,685 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places.
[2024-06-04 18:20:58,685 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 413 transitions, 6617 flow
[2024-06-04 18:20:58,685 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:58,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:58,685 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:58,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 18:20:58,685 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:58,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:58,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1636456283, now seen corresponding path program 7 times
[2024-06-04 18:20:58,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:58,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136928358]
[2024-06-04 18:20:58,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:58,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:58,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:09,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:09,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:09,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136928358]
[2024-06-04 18:21:09,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136928358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:09,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:09,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:21:09,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931661888]
[2024-06-04 18:21:09,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:09,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:21:09,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:09,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:21:09,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:21:10,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:21:10,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 413 transitions, 6617 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:10,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:10,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:21:10,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:11,971 INFO  L124   PetriNetUnfolderBase]: 3684/5532 cut-off events.
[2024-06-04 18:21:11,972 INFO  L125   PetriNetUnfolderBase]: For 343334/343334 co-relation queries the response was YES.
[2024-06-04 18:21:12,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45473 conditions, 5532 events. 3684/5532 cut-off events. For 343334/343334 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 29731 event pairs, 771 based on Foata normal form. 6/5537 useless extension candidates. Maximal degree in co-relation 45340. Up to 5199 conditions per place. 
[2024-06-04 18:21:12,028 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 394 selfloop transitions, 58 changer transitions 0/455 dead transitions.
[2024-06-04 18:21:12,029 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 455 transitions, 7820 flow
[2024-06-04 18:21:12,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:21:12,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:21:12,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-04 18:21:12,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-04 18:21:12,030 INFO  L175             Difference]: Start difference. First operand has 272 places, 413 transitions, 6617 flow. Second operand 9 states and 154 transitions.
[2024-06-04 18:21:12,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 455 transitions, 7820 flow
[2024-06-04 18:21:12,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 455 transitions, 7738 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-04 18:21:12,537 INFO  L231             Difference]: Finished difference. Result has 277 places, 421 transitions, 6831 flow
[2024-06-04 18:21:12,537 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6535, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6831, PETRI_PLACES=277, PETRI_TRANSITIONS=421}
[2024-06-04 18:21:12,550 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 236 predicate places.
[2024-06-04 18:21:12,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 421 transitions, 6831 flow
[2024-06-04 18:21:12,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:12,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:12,550 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:12,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 18:21:12,550 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:21:12,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:12,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 112984140, now seen corresponding path program 5 times
[2024-06-04 18:21:12,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:12,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115583550]
[2024-06-04 18:21:12,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:12,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:12,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:22,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:22,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:22,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115583550]
[2024-06-04 18:21:22,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115583550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:22,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:22,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:21:22,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495417752]
[2024-06-04 18:21:22,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:22,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:21:22,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:22,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:21:22,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:21:22,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:21:22,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 421 transitions, 6831 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:22,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:22,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:21:22,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:24,701 INFO  L124   PetriNetUnfolderBase]: 3801/5723 cut-off events.
[2024-06-04 18:21:24,701 INFO  L125   PetriNetUnfolderBase]: For 366297/366297 co-relation queries the response was YES.
[2024-06-04 18:21:24,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46418 conditions, 5723 events. 3801/5723 cut-off events. For 366297/366297 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 31043 event pairs, 694 based on Foata normal form. 20/5742 useless extension candidates. Maximal degree in co-relation 46284. Up to 5178 conditions per place. 
[2024-06-04 18:21:24,863 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 412 selfloop transitions, 54 changer transitions 0/469 dead transitions.
[2024-06-04 18:21:24,863 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 469 transitions, 8009 flow
[2024-06-04 18:21:24,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:21:24,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:21:24,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 18:21:24,865 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-04 18:21:24,865 INFO  L175             Difference]: Start difference. First operand has 277 places, 421 transitions, 6831 flow. Second operand 9 states and 171 transitions.
[2024-06-04 18:21:24,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 469 transitions, 8009 flow
[2024-06-04 18:21:25,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 469 transitions, 7822 flow, removed 39 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:25,410 INFO  L231             Difference]: Finished difference. Result has 280 places, 424 transitions, 6807 flow
[2024-06-04 18:21:25,410 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6644, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6807, PETRI_PLACES=280, PETRI_TRANSITIONS=424}
[2024-06-04 18:21:25,410 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 239 predicate places.
[2024-06-04 18:21:25,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 424 transitions, 6807 flow
[2024-06-04 18:21:25,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:25,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:25,411 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:25,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-04 18:21:25,411 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:21:25,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:25,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 124435323, now seen corresponding path program 2 times
[2024-06-04 18:21:25,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:25,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746384037]
[2024-06-04 18:21:25,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:25,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:25,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:35,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:35,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:35,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746384037]
[2024-06-04 18:21:35,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746384037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:35,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:35,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:21:35,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34001666]
[2024-06-04 18:21:35,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:35,215 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:21:35,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:35,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:21:35,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:21:35,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:21:35,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 424 transitions, 6807 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:35,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:35,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:21:35,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:36,950 INFO  L124   PetriNetUnfolderBase]: 3809/5735 cut-off events.
[2024-06-04 18:21:36,951 INFO  L125   PetriNetUnfolderBase]: For 342851/342851 co-relation queries the response was YES.
[2024-06-04 18:21:36,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46671 conditions, 5735 events. 3809/5735 cut-off events. For 342851/342851 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 31186 event pairs, 968 based on Foata normal form. 2/5736 useless extension candidates. Maximal degree in co-relation 46536. Up to 5699 conditions per place. 
[2024-06-04 18:21:36,999 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 417 selfloop transitions, 16 changer transitions 0/436 dead transitions.
[2024-06-04 18:21:36,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 436 transitions, 7739 flow
[2024-06-04 18:21:37,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:21:37,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:21:37,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-04 18:21:37,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:21:37,001 INFO  L175             Difference]: Start difference. First operand has 280 places, 424 transitions, 6807 flow. Second operand 6 states and 96 transitions.
[2024-06-04 18:21:37,001 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 436 transitions, 7739 flow
[2024-06-04 18:21:37,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 436 transitions, 7670 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-04 18:21:37,653 INFO  L231             Difference]: Finished difference. Result has 282 places, 426 transitions, 6821 flow
[2024-06-04 18:21:37,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6738, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6821, PETRI_PLACES=282, PETRI_TRANSITIONS=426}
[2024-06-04 18:21:37,654 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 241 predicate places.
[2024-06-04 18:21:37,654 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 426 transitions, 6821 flow
[2024-06-04 18:21:37,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:37,654 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:37,654 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:37,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-04 18:21:37,655 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:21:37,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:37,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 113322753, now seen corresponding path program 3 times
[2024-06-04 18:21:37,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:37,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37252070]
[2024-06-04 18:21:37,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:37,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:37,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15