./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version b44c8288
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/safe031_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m
[2024-05-12 12:22:42,283 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-05-12 12:22:42,353 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-05-12 12:22:42,360 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-05-12 12:22:42,361 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-12 12:22:42,384 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-12 12:22:42,385 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-12 12:22:42,385 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-12 12:22:42,386 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-05-12 12:22:42,389 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-05-12 12:22:42,389 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-12 12:22:42,389 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-12 12:22:42,390 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-12 12:22:42,391 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-05-12 12:22:42,391 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-05-12 12:22:42,392 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-12 12:22:42,392 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-05-12 12:22:42,392 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-05-12 12:22:42,392 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-05-12 12:22:42,392 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-05-12 12:22:42,392 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-05-12 12:22:42,393 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-05-12 12:22:42,393 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-12 12:22:42,393 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-05-12 12:22:42,393 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-05-12 12:22:42,394 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-05-12 12:22:42,394 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-05-12 12:22:42,394 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-05-12 12:22:42,394 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-12 12:22:42,395 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-05-12 12:22:42,395 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-05-12 12:22:42,396 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-05-12 12:22:42,396 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 12:22:42,396 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-12 12:22:42,396 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-05-12 12:22:42,396 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-05-12 12:22:42,396 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-05-12 12:22:42,397 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-12 12:22:42,397 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-12 12:22:42,397 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-05-12 12:22:42,397 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-12 12:22:42,397 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-05-12 12:22:42,397 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-05-12 12:22:42,398 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
[2024-05-12 12:22:42,651 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-12 12:22:42,679 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-12 12:22:42,681 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-12 12:22:42,682 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-05-12 12:22:42,683 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-05-12 12:22:42,683 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml
[2024-05-12 12:22:42,841 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-05-12 12:22:42,841 INFO  L274        PluginConnector]: CDTParser initialized
[2024-05-12 12:22:42,842 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i
[2024-05-12 12:22:43,927 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-05-12 12:22:44,099 INFO  L384              CDTParser]: Found 1 translation units.
[2024-05-12 12:22:44,099 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i
[2024-05-12 12:22:44,110 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12a6bcbd/e8394474fe42400e923b8702eb24245a/FLAG0c0102ce0
[2024-05-12 12:22:44,121 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12a6bcbd/e8394474fe42400e923b8702eb24245a
[2024-05-12 12:22:44,121 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-12 12:22:44,122 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-12 12:22:44,123 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-12 12:22:44,123 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-12 12:22:44,127 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-12 12:22:44,127 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:22:42" (1/2) ...
[2024-05-12 12:22:44,128 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6a75c0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:22:44, skipping insertion in model container
[2024-05-12 12:22:44,128 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:22:42" (1/2) ...
[2024-05-12 12:22:44,129 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b117fd6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:22:44, skipping insertion in model container
[2024-05-12 12:22:44,129 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:22:44" (2/2) ...
[2024-05-12 12:22:44,130 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6a75c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44, skipping insertion in model container
[2024-05-12 12:22:44,130 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:22:44" (2/2) ...
[2024-05-12 12:22:44,130 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-05-12 12:22:44,209 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-05-12 12:22:44,210 INFO  L97    edCorrectnessWitness]: Location invariant before [L820-L820] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 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_thd1 >= 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_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 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_thd1) + (long long )z >= 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_thd2) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )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_thd1 >= 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_thd1 >= 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 )x + (long long )z >= 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_thd1 >= 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_thd1 >= 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 + (long long )z >= 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_thd1 >= 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_thd1 >= 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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 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_thd1 >= 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_thd2 + (long long )z >= 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_thd1 >= 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_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )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_thd1 >= 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_thd1 >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 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_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 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 )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-05-12 12:22:44,211 INFO  L97    edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 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_thd1 >= 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_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 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_thd1) + (long long )z >= 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_thd2) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )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_thd1 >= 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_thd1 >= 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 )x + (long long )z >= 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_thd1 >= 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_thd1 >= 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 + (long long )z >= 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_thd1 >= 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_thd1 >= 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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 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_thd1 >= 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_thd2 + (long long )z >= 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_thd1 >= 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_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )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_thd1 >= 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_thd1 >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 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_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 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 )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-05-12 12:22:44,211 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 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_thd1 >= 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_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 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_thd1) + (long long )z >= 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_thd2) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )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_thd1 >= 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_thd1 >= 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 )x + (long long )z >= 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_thd1 >= 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_thd1 >= 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 + (long long )z >= 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_thd1 >= 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_thd1 >= 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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 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_thd1 >= 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_thd2 + (long long )z >= 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_thd1 >= 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_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )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_thd1 >= 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_thd1 >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 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_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 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 )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-05-12 12:22:44,212 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-05-12 12:22:44,212 INFO  L106   edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1;
[2024-05-12 12:22:44,248 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-05-12 12:22:44,378 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980]
[2024-05-12 12:22:44,499 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 12:22:44,506 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-05-12 12:22:44,533 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980]
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-05-12 12:22:44,770 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 12:22:44,796 INFO  L206         MainTranslator]: Completed translation
[2024-05-12 12:22:44,796 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44 WrapperNode
[2024-05-12 12:22:44,797 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-12 12:22:44,797 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-12 12:22:44,798 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-12 12:22:44,798 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-12 12:22:44,803 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:44,826 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:44,923 INFO  L138                Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149
[2024-05-12 12:22:44,924 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-12 12:22:44,924 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-12 12:22:44,925 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-12 12:22:44,925 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-05-12 12:22:44,933 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:44,933 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:44,959 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,136 INFO  L175           MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1].
[2024-05-12 12:22:45,136 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,136 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,176 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,178 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,189 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,193 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,213 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-12 12:22:45,214 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-12 12:22:45,214 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-05-12 12:22:45,215 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-05-12 12:22:45,215 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (1/1) ...
[2024-05-12 12:22:45,220 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 12:22:45,226 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-05-12 12:22:45,240 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-05-12 12:22:45,259 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-05-12 12:22:45,271 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-05-12 12:22:45,272 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-05-12 12:22:45,272 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-05-12 12:22:45,272 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2024-05-12 12:22:45,272 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-12 12:22:45,273 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-12 12:22:45,273 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-12 12:22:45,273 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-12 12:22:45,273 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-05-12 12:22:45,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-05-12 12:22:45,274 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-05-12 12:22:45,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-05-12 12:22:45,274 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-05-12 12:22:45,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-05-12 12:22:45,276 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-05-12 12:22:45,276 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-05-12 12:22:45,276 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-05-12 12:22:45,276 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-05-12 12:22:45,276 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-12 12:22:45,276 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-12 12:22:45,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-12 12:22:45,277 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-05-12 12:22:45,377 INFO  L244             CfgBuilder]: Building ICFG
[2024-05-12 12:22:45,379 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-12 12:22:46,445 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-05-12 12:22:46,445 INFO  L293             CfgBuilder]: Performing block encoding
[2024-05-12 12:22:46,719 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-12 12:22:46,719 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-12 12:22:46,720 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:22:46 BoogieIcfgContainer
[2024-05-12 12:22:46,720 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-12 12:22:46,723 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-12 12:22:46,723 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-05-12 12:22:46,726 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-05-12 12:22:46,726 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:22:42" (1/4) ...
[2024-05-12 12:22:46,726 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c731b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:22:46, skipping insertion in model container
[2024-05-12 12:22:46,726 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:22:44" (2/4) ...
[2024-05-12 12:22:46,727 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c731b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:22:46, skipping insertion in model container
[2024-05-12 12:22:46,727 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:22:44" (3/4) ...
[2024-05-12 12:22:46,727 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c731b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:22:46, skipping insertion in model container
[2024-05-12 12:22:46,728 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:22:46" (4/4) ...
[2024-05-12 12:22:46,729 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i
[2024-05-12 12:22:46,743 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-12 12:22:46,743 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-05-12 12:22:46,743 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-12 12:22:46,844 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-05-12 12:22:46,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow
[2024-05-12 12:22:46,946 INFO  L124   PetriNetUnfolderBase]: 1/45 cut-off events.
[2024-05-12 12:22:46,946 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 12:22:46,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. 
[2024-05-12 12:22:46,949 INFO  L82        GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow
[2024-05-12 12:22:46,954 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow
[2024-05-12 12:22:46,965 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-05-12 12:22:46,972 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;@232c2921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-12 12:22:46,973 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-05-12 12:22:46,979 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-05-12 12:22:46,980 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-05-12 12:22:46,980 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 12:22:46,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:22:46,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 12:22:46,982 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:22:46,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:22:46,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883198064, now seen corresponding path program 1 times
[2024-05-12 12:22:46,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:22:46,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069179672]
[2024-05-12 12:22:46,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:22:46,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:22:47,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:22:51,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-05-12 12:22:51,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:22:51,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069179672]
[2024-05-12 12:22:51,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069179672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:22:51,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:22:51,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 12:22:51,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055427873]
[2024-05-12 12:22:51,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:22:51,773 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 12:22:51,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:22:51,807 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 12:22:51,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 12:22:51,879 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48
[2024-05-12 12:22:51,881 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:22:51,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:22:51,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48
[2024-05-12 12:22:51,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:22:52,949 INFO  L124   PetriNetUnfolderBase]: 3270/5259 cut-off events.
[2024-05-12 12:22:52,950 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-05-12 12:22:52,960 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10048 conditions, 5259 events. 3270/5259 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 33384 event pairs, 2609 based on Foata normal form. 169/5026 useless extension candidates. Maximal degree in co-relation 10033. Up to 4711 conditions per place. 
[2024-05-12 12:22:52,983 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 44 selfloop transitions, 5 changer transitions 0/60 dead transitions.
[2024-05-12 12:22:52,984 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 233 flow
[2024-05-12 12:22:52,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 12:22:52,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 12:22:52,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions.
[2024-05-12 12:22:52,993 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6666666666666666
[2024-05-12 12:22:52,994 INFO  L175             Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 96 transitions.
[2024-05-12 12:22:52,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 233 flow
[2024-05-12 12:22:52,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-05-12 12:22:53,011 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 131 flow
[2024-05-12 12:22:53,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-05-12 12:22:53,017 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places.
[2024-05-12 12:22:53,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 131 flow
[2024-05-12 12:22:53,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:22:53,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:22:53,017 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:22:53,018 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-12 12:22:53,018 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:22:53,019 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:22:53,019 INFO  L85        PathProgramCache]: Analyzing trace with hash -1572056529, now seen corresponding path program 1 times
[2024-05-12 12:22:53,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:22:53,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393447620]
[2024-05-12 12:22:53,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:22:53,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:22:53,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:22:56,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:22:56,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:22:56,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393447620]
[2024-05-12 12:22:56,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393447620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:22:56,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:22:56,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-12 12:22:56,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272966147]
[2024-05-12 12:22:56,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:22:56,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-05-12 12:22:56,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:22:56,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-05-12 12:22:56,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-05-12 12:22:56,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48
[2024-05-12 12:22:56,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 131 flow. Second operand  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-05-12 12:22:56,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:22:56,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48
[2024-05-12 12:22:56,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:22:57,334 INFO  L124   PetriNetUnfolderBase]: 3263/4751 cut-off events.
[2024-05-12 12:22:57,335 INFO  L125   PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES.
[2024-05-12 12:22:57,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 4751 events. 3263/4751 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 26393 event pairs, 1692 based on Foata normal form. 3/4554 useless extension candidates. Maximal degree in co-relation 10719. Up to 4676 conditions per place. 
[2024-05-12 12:22:57,356 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 56 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2024-05-12 12:22:57,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 331 flow
[2024-05-12 12:22:57,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-05-12 12:22:57,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-05-12 12:22:57,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions.
[2024-05-12 12:22:57,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6458333333333334
[2024-05-12 12:22:57,362 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 131 flow. Second operand 4 states and 124 transitions.
[2024-05-12 12:22:57,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 331 flow
[2024-05-12 12:22:57,368 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-05-12 12:22:57,369 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 177 flow
[2024-05-12 12:22:57,374 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-05-12 12:22:57,374 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2024-05-12 12:22:57,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 177 flow
[2024-05-12 12:22:57,375 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-05-12 12:22:57,375 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:22:57,375 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:22:57,375 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-12 12:22:57,375 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:22:57,376 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:22:57,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -1964371569, now seen corresponding path program 1 times
[2024-05-12 12:22:57,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:22:57,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956542479]
[2024-05-12 12:22:57,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:22:57,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:22:57,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:05,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:05,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:05,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956542479]
[2024-05-12 12:23:05,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956542479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:05,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:05,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 12:23:05,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047828280]
[2024-05-12 12:23:05,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:05,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 12:23:05,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:05,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 12:23:05,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-05-12 12:23:05,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:23:05,940 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 177 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:23:05,940 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:05,940 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:23:05,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:07,562 INFO  L124   PetriNetUnfolderBase]: 4683/6740 cut-off events.
[2024-05-12 12:23:07,562 INFO  L125   PetriNetUnfolderBase]: For 2285/2285 co-relation queries the response was YES.
[2024-05-12 12:23:07,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16600 conditions, 6740 events. 4683/6740 cut-off events. For 2285/2285 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 36955 event pairs, 2330 based on Foata normal form. 2/6473 useless extension candidates. Maximal degree in co-relation 16583. Up to 6668 conditions per place. 
[2024-05-12 12:23:07,603 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 60 selfloop transitions, 10 changer transitions 0/79 dead transitions.
[2024-05-12 12:23:07,603 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 387 flow
[2024-05-12 12:23:07,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 12:23:07,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 12:23:07,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions.
[2024-05-12 12:23:07,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-05-12 12:23:07,607 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 177 flow. Second operand 5 states and 128 transitions.
[2024-05-12 12:23:07,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 387 flow
[2024-05-12 12:23:07,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 368 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-05-12 12:23:07,611 INFO  L231             Difference]: Finished difference. Result has 60 places, 56 transitions, 213 flow
[2024-05-12 12:23:07,611 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=60, PETRI_TRANSITIONS=56}
[2024-05-12 12:23:07,612 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places.
[2024-05-12 12:23:07,613 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 213 flow
[2024-05-12 12:23:07,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:23:07,613 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:07,613 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:07,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-12 12:23:07,614 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:07,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:07,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 628666221, now seen corresponding path program 1 times
[2024-05-12 12:23:07,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:07,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241676395]
[2024-05-12 12:23:07,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:07,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:07,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:10,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:10,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:10,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241676395]
[2024-05-12 12:23:10,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241676395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:10,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:10,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 12:23:10,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027349355]
[2024-05-12 12:23:10,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:10,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 12:23:10,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:10,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 12:23:10,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-05-12 12:23:10,751 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:23:10,751 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 213 flow. Second operand  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-05-12 12:23:10,751 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:10,751 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:23:10,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:11,974 INFO  L124   PetriNetUnfolderBase]: 4149/6110 cut-off events.
[2024-05-12 12:23:11,974 INFO  L125   PetriNetUnfolderBase]: For 3975/3975 co-relation queries the response was YES.
[2024-05-12 12:23:11,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16148 conditions, 6110 events. 4149/6110 cut-off events. For 3975/3975 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35263 event pairs, 1244 based on Foata normal form. 6/5835 useless extension candidates. Maximal degree in co-relation 16129. Up to 5840 conditions per place. 
[2024-05-12 12:23:12,005 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 82 selfloop transitions, 16 changer transitions 0/108 dead transitions.
[2024-05-12 12:23:12,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 545 flow
[2024-05-12 12:23:12,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:23:12,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:23:12,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions.
[2024-05-12 12:23:12,007 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6076388888888888
[2024-05-12 12:23:12,007 INFO  L175             Difference]: Start difference. First operand has 60 places, 56 transitions, 213 flow. Second operand 6 states and 175 transitions.
[2024-05-12 12:23:12,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 545 flow
[2024-05-12 12:23:12,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 520 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-05-12 12:23:12,010 INFO  L231             Difference]: Finished difference. Result has 63 places, 62 transitions, 271 flow
[2024-05-12 12:23:12,010 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=63, PETRI_TRANSITIONS=62}
[2024-05-12 12:23:12,012 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places.
[2024-05-12 12:23:12,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 271 flow
[2024-05-12 12:23:12,012 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-05-12 12:23:12,012 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:12,012 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:12,012 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-12 12:23:12,012 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:12,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:12,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -805299182, now seen corresponding path program 1 times
[2024-05-12 12:23:12,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:12,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507838661]
[2024-05-12 12:23:12,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:12,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:12,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:20,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:20,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:20,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507838661]
[2024-05-12 12:23:20,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507838661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:20,217 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:20,217 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:23:20,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010738540]
[2024-05-12 12:23:20,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:20,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:23:20,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:20,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:23:20,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:23:20,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:23:20,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 271 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-05-12 12:23:20,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:20,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:23:20,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:21,875 INFO  L124   PetriNetUnfolderBase]: 4682/6741 cut-off events.
[2024-05-12 12:23:21,876 INFO  L125   PetriNetUnfolderBase]: For 6718/6718 co-relation queries the response was YES.
[2024-05-12 12:23:21,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19429 conditions, 6741 events. 4682/6741 cut-off events. For 6718/6718 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 37521 event pairs, 1433 based on Foata normal form. 4/6472 useless extension candidates. Maximal degree in co-relation 19409. Up to 6623 conditions per place. 
[2024-05-12 12:23:21,911 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 76 selfloop transitions, 15 changer transitions 0/100 dead transitions.
[2024-05-12 12:23:21,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 557 flow
[2024-05-12 12:23:21,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:23:21,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:23:21,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions.
[2024-05-12 12:23:21,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5347222222222222
[2024-05-12 12:23:21,914 INFO  L175             Difference]: Start difference. First operand has 63 places, 62 transitions, 271 flow. Second operand 6 states and 154 transitions.
[2024-05-12 12:23:21,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 557 flow
[2024-05-12 12:23:21,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 515 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-05-12 12:23:21,920 INFO  L231             Difference]: Finished difference. Result has 66 places, 67 transitions, 309 flow
[2024-05-12 12:23:21,920 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=66, PETRI_TRANSITIONS=67}
[2024-05-12 12:23:21,920 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2024-05-12 12:23:21,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 309 flow
[2024-05-12 12:23:21,921 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-05-12 12:23:21,921 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:21,921 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:21,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-05-12 12:23:21,921 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:21,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:21,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -806269627, now seen corresponding path program 1 times
[2024-05-12 12:23:21,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:21,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466804667]
[2024-05-12 12:23:21,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:21,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:21,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:22,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:22,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:22,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466804667]
[2024-05-12 12:23:22,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466804667] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:22,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:22,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 12:23:22,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002471487]
[2024-05-12 12:23:22,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:22,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 12:23:22,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:22,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 12:23:22,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 12:23:22,120 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48
[2024-05-12 12:23:22,121 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 309 flow. Second operand  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:23:22,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:22,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48
[2024-05-12 12:23:22,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:22,502 INFO  L124   PetriNetUnfolderBase]: 1287/2537 cut-off events.
[2024-05-12 12:23:22,502 INFO  L125   PetriNetUnfolderBase]: For 3492/3651 co-relation queries the response was YES.
[2024-05-12 12:23:22,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6440 conditions, 2537 events. 1287/2537 cut-off events. For 3492/3651 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18486 event pairs, 287 based on Foata normal form. 3/2345 useless extension candidates. Maximal degree in co-relation 6418. Up to 1515 conditions per place. 
[2024-05-12 12:23:22,520 INFO  L140   encePairwiseOnDemand]: 45/48 looper letters, 30 selfloop transitions, 8 changer transitions 0/69 dead transitions.
[2024-05-12 12:23:22,520 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 355 flow
[2024-05-12 12:23:22,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 12:23:22,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 12:23:22,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions.
[2024-05-12 12:23:22,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7222222222222222
[2024-05-12 12:23:22,521 INFO  L175             Difference]: Start difference. First operand has 66 places, 67 transitions, 309 flow. Second operand 3 states and 104 transitions.
[2024-05-12 12:23:22,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 355 flow
[2024-05-12 12:23:22,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 324 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-05-12 12:23:22,525 INFO  L231             Difference]: Finished difference. Result has 63 places, 60 transitions, 244 flow
[2024-05-12 12:23:22,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=63, PETRI_TRANSITIONS=60}
[2024-05-12 12:23:22,528 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places.
[2024-05-12 12:23:22,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 244 flow
[2024-05-12 12:23:22,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:23:22,529 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:22,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:22,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-05-12 12:23:22,529 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:22,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:22,530 INFO  L85        PathProgramCache]: Analyzing trace with hash 2058537640, now seen corresponding path program 1 times
[2024-05-12 12:23:22,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:22,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272688510]
[2024-05-12 12:23:22,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:22,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:22,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:30,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:30,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:30,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272688510]
[2024-05-12 12:23:30,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272688510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:30,414 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:30,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:23:30,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598364645]
[2024-05-12 12:23:30,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:30,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:23:30,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:30,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:23:30,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:23:30,489 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:23:30,489 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 244 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-05-12 12:23:30,489 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:30,489 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:23:30,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:31,897 INFO  L124   PetriNetUnfolderBase]: 4032/5848 cut-off events.
[2024-05-12 12:23:31,897 INFO  L125   PetriNetUnfolderBase]: For 9926/9930 co-relation queries the response was YES.
[2024-05-12 12:23:31,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17340 conditions, 5848 events. 4032/5848 cut-off events. For 9926/9930 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 32246 event pairs, 1286 based on Foata normal form. 6/5848 useless extension candidates. Maximal degree in co-relation 17319. Up to 5683 conditions per place. 
[2024-05-12 12:23:31,923 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 75 selfloop transitions, 16 changer transitions 4/104 dead transitions.
[2024-05-12 12:23:31,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 590 flow
[2024-05-12 12:23:31,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:23:31,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:23:31,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions.
[2024-05-12 12:23:31,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-05-12 12:23:31,925 INFO  L175             Difference]: Start difference. First operand has 63 places, 60 transitions, 244 flow. Second operand 6 states and 156 transitions.
[2024-05-12 12:23:31,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 590 flow
[2024-05-12 12:23:31,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-05-12 12:23:31,930 INFO  L231             Difference]: Finished difference. Result has 67 places, 65 transitions, 312 flow
[2024-05-12 12:23:31,931 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=67, PETRI_TRANSITIONS=65}
[2024-05-12 12:23:31,931 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2024-05-12 12:23:31,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 312 flow
[2024-05-12 12:23:31,931 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-05-12 12:23:31,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:31,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:31,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-05-12 12:23:31,932 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:31,932 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:31,932 INFO  L85        PathProgramCache]: Analyzing trace with hash 2064787240, now seen corresponding path program 2 times
[2024-05-12 12:23:31,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:31,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794904618]
[2024-05-12 12:23:31,933 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:31,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:31,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:39,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:39,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:39,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794904618]
[2024-05-12 12:23:39,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794904618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:39,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:39,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:23:39,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864226304]
[2024-05-12 12:23:39,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:39,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:23:39,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:39,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:23:39,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:23:39,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:23:39,998 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 312 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-05-12 12:23:39,998 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:39,998 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:23:39,998 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:41,471 INFO  L124   PetriNetUnfolderBase]: 3574/5197 cut-off events.
[2024-05-12 12:23:41,472 INFO  L125   PetriNetUnfolderBase]: For 10678/10678 co-relation queries the response was YES.
[2024-05-12 12:23:41,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16338 conditions, 5197 events. 3574/5197 cut-off events. For 10678/10678 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 28271 event pairs, 1155 based on Foata normal form. 2/5194 useless extension candidates. Maximal degree in co-relation 16315. Up to 5051 conditions per place. 
[2024-05-12 12:23:41,496 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 90 selfloop transitions, 17 changer transitions 0/116 dead transitions.
[2024-05-12 12:23:41,496 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 652 flow
[2024-05-12 12:23:41,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:23:41,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:23:41,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions.
[2024-05-12 12:23:41,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5104166666666666
[2024-05-12 12:23:41,498 INFO  L175             Difference]: Start difference. First operand has 67 places, 65 transitions, 312 flow. Second operand 8 states and 196 transitions.
[2024-05-12 12:23:41,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 652 flow
[2024-05-12 12:23:41,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 622 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-05-12 12:23:41,507 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 324 flow
[2024-05-12 12:23:41,507 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=324, PETRI_PLACES=72, PETRI_TRANSITIONS=65}
[2024-05-12 12:23:41,508 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places.
[2024-05-12 12:23:41,508 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 324 flow
[2024-05-12 12:23:41,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-05-12 12:23:41,508 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:41,508 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:41,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-05-12 12:23:41,508 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:41,509 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:41,509 INFO  L85        PathProgramCache]: Analyzing trace with hash -1005284013, now seen corresponding path program 1 times
[2024-05-12 12:23:41,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:41,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780587145]
[2024-05-12 12:23:41,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:41,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:41,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:23:50,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:23:50,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:23:50,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780587145]
[2024-05-12 12:23:50,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780587145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:23:50,212 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:23:50,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:23:50,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715555548]
[2024-05-12 12:23:50,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:23:50,212 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:23:50,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:23:50,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:23:50,213 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:23:50,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:23:50,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 324 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:23:50,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:23:50,330 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:23:50,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:23:51,738 INFO  L124   PetriNetUnfolderBase]: 3651/5324 cut-off events.
[2024-05-12 12:23:51,738 INFO  L125   PetriNetUnfolderBase]: For 12186/12190 co-relation queries the response was YES.
[2024-05-12 12:23:51,745 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16785 conditions, 5324 events. 3651/5324 cut-off events. For 12186/12190 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 29215 event pairs, 1038 based on Foata normal form. 8/5321 useless extension candidates. Maximal degree in co-relation 16760. Up to 5027 conditions per place. 
[2024-05-12 12:23:51,760 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 98 selfloop transitions, 28 changer transitions 0/135 dead transitions.
[2024-05-12 12:23:51,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 858 flow
[2024-05-12 12:23:51,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:23:51,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:23:51,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions.
[2024-05-12 12:23:51,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.53125
[2024-05-12 12:23:51,762 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 324 flow. Second operand 8 states and 204 transitions.
[2024-05-12 12:23:51,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 858 flow
[2024-05-12 12:23:51,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 135 transitions, 784 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-05-12 12:23:51,769 INFO  L231             Difference]: Finished difference. Result has 74 places, 83 transitions, 491 flow
[2024-05-12 12:23:51,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=74, PETRI_TRANSITIONS=83}
[2024-05-12 12:23:51,770 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places.
[2024-05-12 12:23:51,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 491 flow
[2024-05-12 12:23:51,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:23:51,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:23:51,771 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:23:51,771 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-05-12 12:23:51,771 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:23:51,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:23:51,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -416103567, now seen corresponding path program 2 times
[2024-05-12 12:23:51,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:23:51,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741649435]
[2024-05-12 12:23:51,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:23:51,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:23:51,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:24:00,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:24:00,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:24:00,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741649435]
[2024-05-12 12:24:00,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741649435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:24:00,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:24:00,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:24:00,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054769075]
[2024-05-12 12:24:00,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:24:00,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:24:00,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:24:00,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:24:00,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:24:00,616 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:24:00,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 491 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:00,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:24:00,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:24:00,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:24:02,210 INFO  L124   PetriNetUnfolderBase]: 3703/5411 cut-off events.
[2024-05-12 12:24:02,210 INFO  L125   PetriNetUnfolderBase]: For 15742/15742 co-relation queries the response was YES.
[2024-05-12 12:24:02,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18426 conditions, 5411 events. 3703/5411 cut-off events. For 15742/15742 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29744 event pairs, 1027 based on Foata normal form. 4/5405 useless extension candidates. Maximal degree in co-relation 18399. Up to 5073 conditions per place. 
[2024-05-12 12:24:02,233 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 106 selfloop transitions, 34 changer transitions 0/149 dead transitions.
[2024-05-12 12:24:02,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 149 transitions, 993 flow
[2024-05-12 12:24:02,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:24:02,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:24:02,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions.
[2024-05-12 12:24:02,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-05-12 12:24:02,235 INFO  L175             Difference]: Start difference. First operand has 74 places, 83 transitions, 491 flow. Second operand 9 states and 228 transitions.
[2024-05-12 12:24:02,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 149 transitions, 993 flow
[2024-05-12 12:24:02,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 149 transitions, 960 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-05-12 12:24:02,245 INFO  L231             Difference]: Finished difference. Result has 82 places, 89 transitions, 598 flow
[2024-05-12 12:24:02,245 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=598, PETRI_PLACES=82, PETRI_TRANSITIONS=89}
[2024-05-12 12:24:02,246 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 28 predicate places.
[2024-05-12 12:24:02,246 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 598 flow
[2024-05-12 12:24:02,246 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:02,246 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:24:02,246 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:24:02,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-05-12 12:24:02,247 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:24:02,247 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:24:02,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -798363663, now seen corresponding path program 3 times
[2024-05-12 12:24:02,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:24:02,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580898204]
[2024-05-12 12:24:02,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:24:02,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:24:02,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:24:10,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:24:10,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:24:10,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580898204]
[2024-05-12 12:24:10,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580898204] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:24:10,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:24:10,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:24:10,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904253136]
[2024-05-12 12:24:10,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:24:10,913 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:24:10,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:24:10,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:24:10,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:24:11,040 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:24:11,041 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 598 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:11,041 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:24:11,041 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:24:11,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:24:12,581 INFO  L124   PetriNetUnfolderBase]: 3693/5397 cut-off events.
[2024-05-12 12:24:12,582 INFO  L125   PetriNetUnfolderBase]: For 17559/17559 co-relation queries the response was YES.
[2024-05-12 12:24:12,591 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18828 conditions, 5397 events. 3693/5397 cut-off events. For 17559/17559 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29584 event pairs, 1027 based on Foata normal form. 4/5391 useless extension candidates. Maximal degree in co-relation 18797. Up to 5065 conditions per place. 
[2024-05-12 12:24:12,604 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 102 selfloop transitions, 36 changer transitions 0/147 dead transitions.
[2024-05-12 12:24:12,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 147 transitions, 1016 flow
[2024-05-12 12:24:12,605 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:24:12,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:24:12,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions.
[2024-05-12 12:24:12,606 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5162037037037037
[2024-05-12 12:24:12,606 INFO  L175             Difference]: Start difference. First operand has 82 places, 89 transitions, 598 flow. Second operand 9 states and 223 transitions.
[2024-05-12 12:24:12,606 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 147 transitions, 1016 flow
[2024-05-12 12:24:12,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 147 transitions, 908 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-05-12 12:24:12,622 INFO  L231             Difference]: Finished difference. Result has 85 places, 90 transitions, 581 flow
[2024-05-12 12:24:12,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=581, PETRI_PLACES=85, PETRI_TRANSITIONS=90}
[2024-05-12 12:24:12,623 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places.
[2024-05-12 12:24:12,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 581 flow
[2024-05-12 12:24:12,623 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:12,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:24:12,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:24:12,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-05-12 12:24:12,623 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:24:12,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:24:12,624 INFO  L85        PathProgramCache]: Analyzing trace with hash -798353743, now seen corresponding path program 1 times
[2024-05-12 12:24:12,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:24:12,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304407579]
[2024-05-12 12:24:12,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:24:12,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:24:12,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:24:20,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:24:20,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:24:20,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304407579]
[2024-05-12 12:24:20,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304407579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:24:20,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:24:20,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:24:20,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144986766]
[2024-05-12 12:24:20,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:24:20,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:24:20,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:24:20,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:24:20,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:24:20,767 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:24:20,767 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 581 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:20,767 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:24:20,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:24:20,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:24:22,261 INFO  L124   PetriNetUnfolderBase]: 3685/5902 cut-off events.
[2024-05-12 12:24:22,261 INFO  L125   PetriNetUnfolderBase]: For 18579/18579 co-relation queries the response was YES.
[2024-05-12 12:24:22,274 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19301 conditions, 5902 events. 3685/5902 cut-off events. For 18579/18579 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 36215 event pairs, 1354 based on Foata normal form. 4/5723 useless extension candidates. Maximal degree in co-relation 19269. Up to 5213 conditions per place. 
[2024-05-12 12:24:22,291 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 110 selfloop transitions, 17 changer transitions 0/136 dead transitions.
[2024-05-12 12:24:22,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 136 transitions, 1028 flow
[2024-05-12 12:24:22,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:24:22,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:24:22,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-05-12 12:24:22,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-05-12 12:24:22,293 INFO  L175             Difference]: Start difference. First operand has 85 places, 90 transitions, 581 flow. Second operand 7 states and 166 transitions.
[2024-05-12 12:24:22,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 136 transitions, 1028 flow
[2024-05-12 12:24:22,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 136 transitions, 949 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-05-12 12:24:22,305 INFO  L231             Difference]: Finished difference. Result has 89 places, 103 transitions, 700 flow
[2024-05-12 12:24:22,305 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=700, PETRI_PLACES=89, PETRI_TRANSITIONS=103}
[2024-05-12 12:24:22,305 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places.
[2024-05-12 12:24:22,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 103 transitions, 700 flow
[2024-05-12 12:24:22,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:22,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:24:22,306 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:24:22,306 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-05-12 12:24:22,306 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:24:22,307 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:24:22,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731941079, now seen corresponding path program 1 times
[2024-05-12 12:24:22,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:24:22,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495772307]
[2024-05-12 12:24:22,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:24:22,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:24:22,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:24:29,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:24:29,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:24:29,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495772307]
[2024-05-12 12:24:29,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495772307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:24:29,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:24:29,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 12:24:29,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995219871]
[2024-05-12 12:24:29,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:24:29,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 12:24:29,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:24:29,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 12:24:29,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-05-12 12:24:30,023 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:24:30,024 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 103 transitions, 700 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:30,024 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:24:30,024 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:24:30,024 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:24:31,268 INFO  L124   PetriNetUnfolderBase]: 3443/5652 cut-off events.
[2024-05-12 12:24:31,268 INFO  L125   PetriNetUnfolderBase]: For 21198/21199 co-relation queries the response was YES.
[2024-05-12 12:24:31,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18842 conditions, 5652 events. 3443/5652 cut-off events. For 21198/21199 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35016 event pairs, 1623 based on Foata normal form. 1/5466 useless extension candidates. Maximal degree in co-relation 18806. Up to 4909 conditions per place. 
[2024-05-12 12:24:31,295 INFO  L140   encePairwiseOnDemand]: 40/48 looper letters, 97 selfloop transitions, 9 changer transitions 0/125 dead transitions.
[2024-05-12 12:24:31,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 125 transitions, 1006 flow
[2024-05-12 12:24:31,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 12:24:31,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 12:24:31,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions.
[2024-05-12 12:24:31,296 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49583333333333335
[2024-05-12 12:24:31,296 INFO  L175             Difference]: Start difference. First operand has 89 places, 103 transitions, 700 flow. Second operand 5 states and 119 transitions.
[2024-05-12 12:24:31,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 125 transitions, 1006 flow
[2024-05-12 12:24:31,308 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 125 transitions, 961 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-05-12 12:24:31,310 INFO  L231             Difference]: Finished difference. Result has 93 places, 110 transitions, 752 flow
[2024-05-12 12:24:31,310 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=752, PETRI_PLACES=93, PETRI_TRANSITIONS=110}
[2024-05-12 12:24:31,310 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places.
[2024-05-12 12:24:31,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 110 transitions, 752 flow
[2024-05-12 12:24:31,311 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:31,311 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:24:31,311 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:24:31,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-05-12 12:24:31,311 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:24:31,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:24:31,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -1146670411, now seen corresponding path program 1 times
[2024-05-12 12:24:31,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:24:31,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594735652]
[2024-05-12 12:24:31,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:24:31,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:24:31,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:24:39,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:24:39,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:24:39,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594735652]
[2024-05-12 12:24:39,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594735652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:24:39,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:24:39,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:24:39,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027063105]
[2024-05-12 12:24:39,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:24:39,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:24:39,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:24:39,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:24:39,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:24:39,965 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:24:39,965 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 110 transitions, 752 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:39,965 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:24:39,965 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:24:39,965 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:24:41,508 INFO  L124   PetriNetUnfolderBase]: 3716/5941 cut-off events.
[2024-05-12 12:24:41,508 INFO  L125   PetriNetUnfolderBase]: For 25472/25472 co-relation queries the response was YES.
[2024-05-12 12:24:41,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21059 conditions, 5941 events. 3716/5941 cut-off events. For 25472/25472 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 36322 event pairs, 1427 based on Foata normal form. 2/5760 useless extension candidates. Maximal degree in co-relation 21020. Up to 5235 conditions per place. 
[2024-05-12 12:24:41,543 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 108 selfloop transitions, 27 changer transitions 0/144 dead transitions.
[2024-05-12 12:24:41,544 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 1138 flow
[2024-05-12 12:24:41,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:24:41,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:24:41,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions.
[2024-05-12 12:24:41,545 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208333333333334
[2024-05-12 12:24:41,545 INFO  L175             Difference]: Start difference. First operand has 93 places, 110 transitions, 752 flow. Second operand 6 states and 150 transitions.
[2024-05-12 12:24:41,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 1138 flow
[2024-05-12 12:24:41,561 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 144 transitions, 1106 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-05-12 12:24:41,563 INFO  L231             Difference]: Finished difference. Result has 96 places, 113 transitions, 824 flow
[2024-05-12 12:24:41,563 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=824, PETRI_PLACES=96, PETRI_TRANSITIONS=113}
[2024-05-12 12:24:41,563 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places.
[2024-05-12 12:24:41,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 113 transitions, 824 flow
[2024-05-12 12:24:41,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:41,563 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:24:41,563 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:24:41,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-05-12 12:24:41,564 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:24:41,564 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:24:41,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141908811, now seen corresponding path program 2 times
[2024-05-12 12:24:41,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:24:41,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222299730]
[2024-05-12 12:24:41,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:24:41,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:24:41,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:24:49,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:24:49,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:24:49,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222299730]
[2024-05-12 12:24:49,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222299730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:24:49,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:24:49,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:24:49,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410514023]
[2024-05-12 12:24:49,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:24:49,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:24:49,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:24:49,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:24:49,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:24:49,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:24:49,734 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 113 transitions, 824 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:49,734 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:24:49,734 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:24:49,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:24:51,247 INFO  L124   PetriNetUnfolderBase]: 3742/5990 cut-off events.
[2024-05-12 12:24:51,247 INFO  L125   PetriNetUnfolderBase]: For 29911/29917 co-relation queries the response was YES.
[2024-05-12 12:24:51,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22258 conditions, 5990 events. 3742/5990 cut-off events. For 29911/29917 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 36799 event pairs, 1393 based on Foata normal form. 8/5814 useless extension candidates. Maximal degree in co-relation 22218. Up to 5188 conditions per place. 
[2024-05-12 12:24:51,277 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 113 selfloop transitions, 40 changer transitions 0/162 dead transitions.
[2024-05-12 12:24:51,277 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 162 transitions, 1372 flow
[2024-05-12 12:24:51,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:24:51,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:24:51,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions.
[2024-05-12 12:24:51,278 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5297619047619048
[2024-05-12 12:24:51,279 INFO  L175             Difference]: Start difference. First operand has 96 places, 113 transitions, 824 flow. Second operand 7 states and 178 transitions.
[2024-05-12 12:24:51,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 162 transitions, 1372 flow
[2024-05-12 12:24:51,297 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 162 transitions, 1302 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-05-12 12:24:51,299 INFO  L231             Difference]: Finished difference. Result has 98 places, 119 transitions, 921 flow
[2024-05-12 12:24:51,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=921, PETRI_PLACES=98, PETRI_TRANSITIONS=119}
[2024-05-12 12:24:51,299 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places.
[2024-05-12 12:24:51,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 921 flow
[2024-05-12 12:24:51,300 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:24:51,300 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:24:51,300 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:24:51,300 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-05-12 12:24:51,300 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:24:51,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:24:51,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -14314169, now seen corresponding path program 3 times
[2024-05-12 12:24:51,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:24:51,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146689209]
[2024-05-12 12:24:51,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:24:51,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:24:51,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:25:00,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:25:00,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:25:00,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146689209]
[2024-05-12 12:25:00,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146689209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:25:00,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:25:00,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:25:00,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107344473]
[2024-05-12 12:25:00,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:25:00,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:25:00,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:25:00,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:25:00,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:25:00,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:25:00,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 921 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:00,283 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:25:00,283 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:25:00,283 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:25:01,845 INFO  L124   PetriNetUnfolderBase]: 3737/5983 cut-off events.
[2024-05-12 12:25:01,845 INFO  L125   PetriNetUnfolderBase]: For 32350/32350 co-relation queries the response was YES.
[2024-05-12 12:25:01,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22912 conditions, 5983 events. 3737/5983 cut-off events. For 32350/32350 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 36742 event pairs, 1386 based on Foata normal form. 2/5801 useless extension candidates. Maximal degree in co-relation 22872. Up to 5183 conditions per place. 
[2024-05-12 12:25:01,879 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 123 selfloop transitions, 43 changer transitions 0/175 dead transitions.
[2024-05-12 12:25:01,879 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 175 transitions, 1409 flow
[2024-05-12 12:25:01,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:25:01,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:25:01,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions.
[2024-05-12 12:25:01,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5138888888888888
[2024-05-12 12:25:01,885 INFO  L175             Difference]: Start difference. First operand has 98 places, 119 transitions, 921 flow. Second operand 9 states and 222 transitions.
[2024-05-12 12:25:01,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 175 transitions, 1409 flow
[2024-05-12 12:25:01,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 175 transitions, 1346 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-05-12 12:25:01,909 INFO  L231             Difference]: Finished difference. Result has 104 places, 119 transitions, 953 flow
[2024-05-12 12:25:01,910 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=953, PETRI_PLACES=104, PETRI_TRANSITIONS=119}
[2024-05-12 12:25:01,910 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 50 predicate places.
[2024-05-12 12:25:01,911 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 953 flow
[2024-05-12 12:25:01,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:01,911 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:25:01,911 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:25:01,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-05-12 12:25:01,911 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:25:01,912 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:25:01,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -2121965337, now seen corresponding path program 1 times
[2024-05-12 12:25:01,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:25:01,912 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816492792]
[2024-05-12 12:25:01,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:25:01,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:25:01,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:25:09,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:25:09,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:25:09,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816492792]
[2024-05-12 12:25:09,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816492792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:25:09,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:25:09,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:25:09,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574572756]
[2024-05-12 12:25:09,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:25:09,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:25:09,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:25:09,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:25:09,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:25:10,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:25:10,099 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 953 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:10,099 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:25:10,099 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:25:10,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:25:11,465 INFO  L124   PetriNetUnfolderBase]: 3538/5797 cut-off events.
[2024-05-12 12:25:11,465 INFO  L125   PetriNetUnfolderBase]: For 34440/34460 co-relation queries the response was YES.
[2024-05-12 12:25:11,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22292 conditions, 5797 events. 3538/5797 cut-off events. For 34440/34460 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 36293 event pairs, 1565 based on Foata normal form. 15/5612 useless extension candidates. Maximal degree in co-relation 22250. Up to 4935 conditions per place. 
[2024-05-12 12:25:11,497 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 115 selfloop transitions, 21 changer transitions 0/155 dead transitions.
[2024-05-12 12:25:11,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 155 transitions, 1431 flow
[2024-05-12 12:25:11,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:25:11,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:25:11,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions.
[2024-05-12 12:25:11,499 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5069444444444444
[2024-05-12 12:25:11,499 INFO  L175             Difference]: Start difference. First operand has 104 places, 119 transitions, 953 flow. Second operand 6 states and 146 transitions.
[2024-05-12 12:25:11,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 155 transitions, 1431 flow
[2024-05-12 12:25:11,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 1308 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-05-12 12:25:11,517 INFO  L231             Difference]: Finished difference. Result has 104 places, 133 transitions, 1036 flow
[2024-05-12 12:25:11,517 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1036, PETRI_PLACES=104, PETRI_TRANSITIONS=133}
[2024-05-12 12:25:11,518 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 50 predicate places.
[2024-05-12 12:25:11,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 133 transitions, 1036 flow
[2024-05-12 12:25:11,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:11,518 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:25:11,518 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:25:11,518 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-05-12 12:25:11,519 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:25:11,519 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:25:11,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 573019540, now seen corresponding path program 1 times
[2024-05-12 12:25:11,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:25:11,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975362360]
[2024-05-12 12:25:11,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:25:11,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:25:11,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:25:19,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:25:19,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:25:19,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975362360]
[2024-05-12 12:25:19,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975362360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:25:19,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:25:19,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:25:19,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113904361]
[2024-05-12 12:25:19,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:25:19,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:25:19,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:25:19,923 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:25:19,923 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:25:20,041 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:25:20,042 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 133 transitions, 1036 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:20,042 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:25:20,042 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:25:20,042 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:25:21,874 INFO  L124   PetriNetUnfolderBase]: 3995/6372 cut-off events.
[2024-05-12 12:25:21,874 INFO  L125   PetriNetUnfolderBase]: For 42762/42762 co-relation queries the response was YES.
[2024-05-12 12:25:21,896 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26630 conditions, 6372 events. 3995/6372 cut-off events. For 42762/42762 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 38919 event pairs, 1570 based on Foata normal form. 4/6184 useless extension candidates. Maximal degree in co-relation 26585. Up to 5538 conditions per place. 
[2024-05-12 12:25:21,984 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 175 selfloop transitions, 53 changer transitions 0/237 dead transitions.
[2024-05-12 12:25:21,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 237 transitions, 1970 flow
[2024-05-12 12:25:22,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-05-12 12:25:22,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-05-12 12:25:22,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 295 transitions.
[2024-05-12 12:25:22,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121527777777778
[2024-05-12 12:25:22,002 INFO  L175             Difference]: Start difference. First operand has 104 places, 133 transitions, 1036 flow. Second operand 12 states and 295 transitions.
[2024-05-12 12:25:22,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 237 transitions, 1970 flow
[2024-05-12 12:25:22,030 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 237 transitions, 1946 flow, removed 11 selfloop flow, removed 1 redundant places.
[2024-05-12 12:25:22,032 INFO  L231             Difference]: Finished difference. Result has 118 places, 158 transitions, 1374 flow
[2024-05-12 12:25:22,033 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1374, PETRI_PLACES=118, PETRI_TRANSITIONS=158}
[2024-05-12 12:25:22,033 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 64 predicate places.
[2024-05-12 12:25:22,033 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 158 transitions, 1374 flow
[2024-05-12 12:25:22,033 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:22,033 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:25:22,033 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:25:22,034 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-05-12 12:25:22,034 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:25:22,034 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:25:22,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 141927060, now seen corresponding path program 2 times
[2024-05-12 12:25:22,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:25:22,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109846092]
[2024-05-12 12:25:22,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:25:22,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:25:22,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:25:31,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:25:31,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:25:31,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109846092]
[2024-05-12 12:25:31,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109846092] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:25:31,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:25:31,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:25:31,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487122449]
[2024-05-12 12:25:31,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:25:31,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:25:31,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:25:31,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:25:31,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:25:32,093 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:25:32,094 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 158 transitions, 1374 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:32,094 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:25:32,094 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:25:32,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:25:33,775 INFO  L124   PetriNetUnfolderBase]: 4051/6464 cut-off events.
[2024-05-12 12:25:33,776 INFO  L125   PetriNetUnfolderBase]: For 52959/52959 co-relation queries the response was YES.
[2024-05-12 12:25:33,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29083 conditions, 6464 events. 4051/6464 cut-off events. For 52959/52959 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 39649 event pairs, 1556 based on Foata normal form. 6/6276 useless extension candidates. Maximal degree in co-relation 29032. Up to 5555 conditions per place. 
[2024-05-12 12:25:33,818 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 154 selfloop transitions, 59 changer transitions 0/222 dead transitions.
[2024-05-12 12:25:33,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 222 transitions, 2266 flow
[2024-05-12 12:25:33,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:25:33,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:25:33,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions.
[2024-05-12 12:25:33,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-05-12 12:25:33,819 INFO  L175             Difference]: Start difference. First operand has 118 places, 158 transitions, 1374 flow. Second operand 7 states and 176 transitions.
[2024-05-12 12:25:33,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 222 transitions, 2266 flow
[2024-05-12 12:25:33,867 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 222 transitions, 2026 flow, removed 82 selfloop flow, removed 5 redundant places.
[2024-05-12 12:25:33,869 INFO  L231             Difference]: Finished difference. Result has 122 places, 185 transitions, 1703 flow
[2024-05-12 12:25:33,870 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1703, PETRI_PLACES=122, PETRI_TRANSITIONS=185}
[2024-05-12 12:25:33,870 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 68 predicate places.
[2024-05-12 12:25:33,870 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 185 transitions, 1703 flow
[2024-05-12 12:25:33,870 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:33,870 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:25:33,870 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:25:33,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-05-12 12:25:33,871 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:25:33,871 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:25:33,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -1039225950, now seen corresponding path program 3 times
[2024-05-12 12:25:33,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:25:33,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092014007]
[2024-05-12 12:25:33,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:25:33,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:25:33,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:25:43,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:25:43,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:25:43,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092014007]
[2024-05-12 12:25:43,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092014007] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:25:43,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:25:43,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:25:43,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667336074]
[2024-05-12 12:25:43,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:25:43,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:25:43,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:25:43,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:25:43,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:25:43,483 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:25:43,484 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 185 transitions, 1703 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:43,484 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:25:43,484 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:25:43,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:25:45,363 INFO  L124   PetriNetUnfolderBase]: 4185/6706 cut-off events.
[2024-05-12 12:25:45,363 INFO  L125   PetriNetUnfolderBase]: For 61317/61323 co-relation queries the response was YES.
[2024-05-12 12:25:45,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31624 conditions, 6706 events. 4185/6706 cut-off events. For 61317/61323 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 41674 event pairs, 1346 based on Foata normal form. 10/6520 useless extension candidates. Maximal degree in co-relation 31569. Up to 5380 conditions per place. 
[2024-05-12 12:25:45,417 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 163 selfloop transitions, 94 changer transitions 0/266 dead transitions.
[2024-05-12 12:25:45,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 266 transitions, 2809 flow
[2024-05-12 12:25:45,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:25:45,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:25:45,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions.
[2024-05-12 12:25:45,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-05-12 12:25:45,420 INFO  L175             Difference]: Start difference. First operand has 122 places, 185 transitions, 1703 flow. Second operand 9 states and 234 transitions.
[2024-05-12 12:25:45,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 266 transitions, 2809 flow
[2024-05-12 12:25:45,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 266 transitions, 2720 flow, removed 36 selfloop flow, removed 3 redundant places.
[2024-05-12 12:25:45,494 INFO  L231             Difference]: Finished difference. Result has 130 places, 203 transitions, 2142 flow
[2024-05-12 12:25:45,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2142, PETRI_PLACES=130, PETRI_TRANSITIONS=203}
[2024-05-12 12:25:45,495 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 76 predicate places.
[2024-05-12 12:25:45,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 203 transitions, 2142 flow
[2024-05-12 12:25:45,495 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:45,495 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:25:45,495 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:25:45,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-05-12 12:25:45,495 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:25:45,496 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:25:45,496 INFO  L85        PathProgramCache]: Analyzing trace with hash 145646130, now seen corresponding path program 4 times
[2024-05-12 12:25:45,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:25:45,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4707898]
[2024-05-12 12:25:45,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:25:45,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:25:45,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:25:55,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:25:55,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:25:55,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4707898]
[2024-05-12 12:25:55,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4707898] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:25:55,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:25:55,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:25:55,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760183224]
[2024-05-12 12:25:55,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:25:55,348 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:25:55,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:25:55,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:25:55,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:25:55,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:25:55,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 203 transitions, 2142 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:55,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:25:55,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:25:55,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:25:57,306 INFO  L124   PetriNetUnfolderBase]: 4175/6681 cut-off events.
[2024-05-12 12:25:57,306 INFO  L125   PetriNetUnfolderBase]: For 66534/66540 co-relation queries the response was YES.
[2024-05-12 12:25:57,330 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32973 conditions, 6681 events. 4175/6681 cut-off events. For 66534/66540 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 41286 event pairs, 1355 based on Foata normal form. 10/6499 useless extension candidates. Maximal degree in co-relation 32915. Up to 5372 conditions per place. 
[2024-05-12 12:25:57,354 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 165 selfloop transitions, 91 changer transitions 0/265 dead transitions.
[2024-05-12 12:25:57,354 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 265 transitions, 2937 flow
[2024-05-12 12:25:57,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:25:57,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:25:57,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions.
[2024-05-12 12:25:57,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-05-12 12:25:57,355 INFO  L175             Difference]: Start difference. First operand has 130 places, 203 transitions, 2142 flow. Second operand 9 states and 234 transitions.
[2024-05-12 12:25:57,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 265 transitions, 2937 flow
[2024-05-12 12:25:57,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 265 transitions, 2797 flow, removed 58 selfloop flow, removed 3 redundant places.
[2024-05-12 12:25:57,444 INFO  L231             Difference]: Finished difference. Result has 136 places, 203 transitions, 2193 flow
[2024-05-12 12:25:57,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2193, PETRI_PLACES=136, PETRI_TRANSITIONS=203}
[2024-05-12 12:25:57,445 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 82 predicate places.
[2024-05-12 12:25:57,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 203 transitions, 2193 flow
[2024-05-12 12:25:57,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:25:57,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:25:57,445 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:25:57,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-05-12 12:25:57,445 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:25:57,446 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:25:57,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 1247382696, now seen corresponding path program 1 times
[2024-05-12 12:25:57,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:25:57,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220911223]
[2024-05-12 12:25:57,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:25:57,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:25:57,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:26:06,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:26:06,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:26:06,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220911223]
[2024-05-12 12:26:06,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220911223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:26:06,410 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:26:06,410 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:26:06,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765220073]
[2024-05-12 12:26:06,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:26:06,410 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:26:06,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:26:06,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:26:06,411 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:26:06,521 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:26:06,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 203 transitions, 2193 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:06,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:26:06,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:26:06,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:26:08,345 INFO  L124   PetriNetUnfolderBase]: 4217/6742 cut-off events.
[2024-05-12 12:26:08,345 INFO  L125   PetriNetUnfolderBase]: For 68654/68660 co-relation queries the response was YES.
[2024-05-12 12:26:08,373 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33434 conditions, 6742 events. 4217/6742 cut-off events. For 68654/68660 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 41699 event pairs, 1398 based on Foata normal form. 10/6560 useless extension candidates. Maximal degree in co-relation 33374. Up to 5756 conditions per place. 
[2024-05-12 12:26:08,398 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 207 selfloop transitions, 49 changer transitions 0/265 dead transitions.
[2024-05-12 12:26:08,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 265 transitions, 2968 flow
[2024-05-12 12:26:08,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:26:08,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:26:08,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions.
[2024-05-12 12:26:08,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5231481481481481
[2024-05-12 12:26:08,400 INFO  L175             Difference]: Start difference. First operand has 136 places, 203 transitions, 2193 flow. Second operand 9 states and 226 transitions.
[2024-05-12 12:26:08,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 265 transitions, 2968 flow
[2024-05-12 12:26:08,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 265 transitions, 2742 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-05-12 12:26:08,470 INFO  L231             Difference]: Finished difference. Result has 138 places, 206 transitions, 2127 flow
[2024-05-12 12:26:08,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2127, PETRI_PLACES=138, PETRI_TRANSITIONS=206}
[2024-05-12 12:26:08,471 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places.
[2024-05-12 12:26:08,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 206 transitions, 2127 flow
[2024-05-12 12:26:08,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:08,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:26:08,471 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:26:08,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-05-12 12:26:08,471 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:26:08,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:26:08,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 2039546568, now seen corresponding path program 1 times
[2024-05-12 12:26:08,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:26:08,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239497554]
[2024-05-12 12:26:08,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:26:08,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:26:08,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:26:16,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:26:16,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:26:16,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239497554]
[2024-05-12 12:26:16,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239497554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:26:16,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:26:16,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:26:16,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055158408]
[2024-05-12 12:26:16,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:26:16,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:26:16,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:26:16,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:26:16,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:26:16,387 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:26:16,388 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 206 transitions, 2127 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:16,388 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:26:16,388 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:26:16,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:26:17,897 INFO  L124   PetriNetUnfolderBase]: 3951/6448 cut-off events.
[2024-05-12 12:26:17,897 INFO  L125   PetriNetUnfolderBase]: For 72492/72530 co-relation queries the response was YES.
[2024-05-12 12:26:17,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32432 conditions, 6448 events. 3951/6448 cut-off events. For 72492/72530 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40401 event pairs, 1541 based on Foata normal form. 12/6220 useless extension candidates. Maximal degree in co-relation 32371. Up to 5531 conditions per place. 
[2024-05-12 12:26:17,946 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 195 selfloop transitions, 18 changer transitions 0/233 dead transitions.
[2024-05-12 12:26:17,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 233 transitions, 2681 flow
[2024-05-12 12:26:17,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:26:17,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:26:17,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-05-12 12:26:17,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5034722222222222
[2024-05-12 12:26:17,948 INFO  L175             Difference]: Start difference. First operand has 138 places, 206 transitions, 2127 flow. Second operand 6 states and 145 transitions.
[2024-05-12 12:26:17,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 233 transitions, 2681 flow
[2024-05-12 12:26:18,012 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 233 transitions, 2543 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-05-12 12:26:18,015 INFO  L231             Difference]: Finished difference. Result has 137 places, 209 transitions, 2069 flow
[2024-05-12 12:26:18,015 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2069, PETRI_PLACES=137, PETRI_TRANSITIONS=209}
[2024-05-12 12:26:18,015 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 83 predicate places.
[2024-05-12 12:26:18,015 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 209 transitions, 2069 flow
[2024-05-12 12:26:18,016 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:18,016 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:26:18,016 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:26:18,016 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-05-12 12:26:18,016 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:26:18,016 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:26:18,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -277624182, now seen corresponding path program 5 times
[2024-05-12 12:26:18,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:26:18,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904614258]
[2024-05-12 12:26:18,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:26:18,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:26:18,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:26:27,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:26:27,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:26:27,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904614258]
[2024-05-12 12:26:27,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904614258] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:26:27,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:26:27,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:26:27,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306263567]
[2024-05-12 12:26:27,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:26:27,288 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:26:27,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:26:27,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:26:27,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:26:27,433 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:26:27,434 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 209 transitions, 2069 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:27,434 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:26:27,434 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:26:27,434 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:26:29,477 INFO  L124   PetriNetUnfolderBase]: 4441/7093 cut-off events.
[2024-05-12 12:26:29,477 INFO  L125   PetriNetUnfolderBase]: For 82790/82790 co-relation queries the response was YES.
[2024-05-12 12:26:29,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36052 conditions, 7093 events. 4441/7093 cut-off events. For 82790/82790 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 44187 event pairs, 1351 based on Foata normal form. 4/6900 useless extension candidates. Maximal degree in co-relation 35990. Up to 5628 conditions per place. 
[2024-05-12 12:26:29,536 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 179 selfloop transitions, 128 changer transitions 0/316 dead transitions.
[2024-05-12 12:26:29,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 316 transitions, 3549 flow
[2024-05-12 12:26:29,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:26:29,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:26:29,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions.
[2024-05-12 12:26:29,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5378787878787878
[2024-05-12 12:26:29,537 INFO  L175             Difference]: Start difference. First operand has 137 places, 209 transitions, 2069 flow. Second operand 11 states and 284 transitions.
[2024-05-12 12:26:29,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 316 transitions, 3549 flow
[2024-05-12 12:26:29,617 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 316 transitions, 3496 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-05-12 12:26:29,621 INFO  L231             Difference]: Finished difference. Result has 148 places, 237 transitions, 2849 flow
[2024-05-12 12:26:29,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2849, PETRI_PLACES=148, PETRI_TRANSITIONS=237}
[2024-05-12 12:26:29,621 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 94 predicate places.
[2024-05-12 12:26:29,621 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 237 transitions, 2849 flow
[2024-05-12 12:26:29,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:29,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:26:29,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:26:29,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-05-12 12:26:29,622 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:26:29,622 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:26:29,622 INFO  L85        PathProgramCache]: Analyzing trace with hash 1314996884, now seen corresponding path program 6 times
[2024-05-12 12:26:29,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:26:29,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844433711]
[2024-05-12 12:26:29,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:26:29,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:26:29,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:26:39,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:26:39,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:26:39,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844433711]
[2024-05-12 12:26:39,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844433711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:26:39,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:26:39,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:26:39,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111118322]
[2024-05-12 12:26:39,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:26:39,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:26:39,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:26:39,451 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:26:39,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:26:39,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:26:39,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 237 transitions, 2849 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:39,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:26:39,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:26:39,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:26:41,704 INFO  L124   PetriNetUnfolderBase]: 4431/7086 cut-off events.
[2024-05-12 12:26:41,704 INFO  L125   PetriNetUnfolderBase]: For 92794/92794 co-relation queries the response was YES.
[2024-05-12 12:26:41,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38376 conditions, 7086 events. 4431/7086 cut-off events. For 92794/92794 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 44061 event pairs, 1384 based on Foata normal form. 4/6894 useless extension candidates. Maximal degree in co-relation 38310. Up to 5678 conditions per place. 
[2024-05-12 12:26:41,765 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 192 selfloop transitions, 103 changer transitions 0/304 dead transitions.
[2024-05-12 12:26:41,765 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 304 transitions, 3756 flow
[2024-05-12 12:26:41,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:26:41,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:26:41,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions.
[2024-05-12 12:26:41,766 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-05-12 12:26:41,766 INFO  L175             Difference]: Start difference. First operand has 148 places, 237 transitions, 2849 flow. Second operand 10 states and 256 transitions.
[2024-05-12 12:26:41,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 304 transitions, 3756 flow
[2024-05-12 12:26:41,902 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 304 transitions, 3446 flow, removed 111 selfloop flow, removed 5 redundant places.
[2024-05-12 12:26:41,905 INFO  L231             Difference]: Finished difference. Result has 154 places, 238 transitions, 2779 flow
[2024-05-12 12:26:41,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2779, PETRI_PLACES=154, PETRI_TRANSITIONS=238}
[2024-05-12 12:26:41,906 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 100 predicate places.
[2024-05-12 12:26:41,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 238 transitions, 2779 flow
[2024-05-12 12:26:41,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:41,906 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:26:41,906 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:26:41,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-05-12 12:26:41,906 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:26:41,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:26:41,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 20143184, now seen corresponding path program 7 times
[2024-05-12 12:26:41,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:26:41,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542623465]
[2024-05-12 12:26:41,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:26:41,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:26:41,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:26:48,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:26:48,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:26:48,425 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542623465]
[2024-05-12 12:26:48,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542623465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:26:48,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:26:48,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:26:48,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445850851]
[2024-05-12 12:26:48,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:26:48,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:26:48,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:26:48,426 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:26:48,426 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:26:48,580 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:26:48,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 238 transitions, 2779 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:48,581 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:26:48,581 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:26:48,581 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:26:50,680 INFO  L124   PetriNetUnfolderBase]: 4421/7069 cut-off events.
[2024-05-12 12:26:50,680 INFO  L125   PetriNetUnfolderBase]: For 91702/91702 co-relation queries the response was YES.
[2024-05-12 12:26:50,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37958 conditions, 7069 events. 4421/7069 cut-off events. For 91702/91702 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 44077 event pairs, 1378 based on Foata normal form. 4/6875 useless extension candidates. Maximal degree in co-relation 37890. Up to 5765 conditions per place. 
[2024-05-12 12:26:50,740 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 239 selfloop transitions, 103 changer transitions 0/351 dead transitions.
[2024-05-12 12:26:50,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 351 transitions, 4434 flow
[2024-05-12 12:26:50,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:26:50,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:26:50,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions.
[2024-05-12 12:26:50,742 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5056818181818182
[2024-05-12 12:26:50,742 INFO  L175             Difference]: Start difference. First operand has 154 places, 238 transitions, 2779 flow. Second operand 11 states and 267 transitions.
[2024-05-12 12:26:50,742 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 351 transitions, 4434 flow
[2024-05-12 12:26:50,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 351 transitions, 4009 flow, removed 51 selfloop flow, removed 8 redundant places.
[2024-05-12 12:26:50,850 INFO  L231             Difference]: Finished difference. Result has 164 places, 287 transitions, 3515 flow
[2024-05-12 12:26:50,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3515, PETRI_PLACES=164, PETRI_TRANSITIONS=287}
[2024-05-12 12:26:50,851 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 110 predicate places.
[2024-05-12 12:26:50,851 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 287 transitions, 3515 flow
[2024-05-12 12:26:50,851 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:50,851 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:26:50,851 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:26:50,851 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-05-12 12:26:50,851 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:26:50,852 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:26:50,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -277616246, now seen corresponding path program 2 times
[2024-05-12 12:26:50,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:26:50,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551334581]
[2024-05-12 12:26:50,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:26:50,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:26:50,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:26:59,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:26:59,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:26:59,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551334581]
[2024-05-12 12:26:59,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551334581] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:26:59,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:26:59,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:26:59,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597787423]
[2024-05-12 12:26:59,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:26:59,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:26:59,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:26:59,696 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:26:59,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:26:59,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:26:59,910 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 287 transitions, 3515 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:26:59,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:26:59,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:26:59,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:27:02,079 INFO  L124   PetriNetUnfolderBase]: 4463/7150 cut-off events.
[2024-05-12 12:27:02,079 INFO  L125   PetriNetUnfolderBase]: For 95647/95647 co-relation queries the response was YES.
[2024-05-12 12:27:02,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39078 conditions, 7150 events. 4463/7150 cut-off events. For 95647/95647 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 44635 event pairs, 1430 based on Foata normal form. 4/6952 useless extension candidates. Maximal degree in co-relation 39002. Up to 6100 conditions per place. 
[2024-05-12 12:27:02,135 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 277 selfloop transitions, 69 changer transitions 0/355 dead transitions.
[2024-05-12 12:27:02,135 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 355 transitions, 4496 flow
[2024-05-12 12:27:02,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:27:02,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:27:02,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions.
[2024-05-12 12:27:02,136 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208333333333334
[2024-05-12 12:27:02,136 INFO  L175             Difference]: Start difference. First operand has 164 places, 287 transitions, 3515 flow. Second operand 10 states and 250 transitions.
[2024-05-12 12:27:02,136 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 355 transitions, 4496 flow
[2024-05-12 12:27:02,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 355 transitions, 4389 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-05-12 12:27:02,231 INFO  L231             Difference]: Finished difference. Result has 172 places, 290 transitions, 3619 flow
[2024-05-12 12:27:02,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3408, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3619, PETRI_PLACES=172, PETRI_TRANSITIONS=290}
[2024-05-12 12:27:02,232 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 118 predicate places.
[2024-05-12 12:27:02,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 290 transitions, 3619 flow
[2024-05-12 12:27:02,232 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:02,232 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:27:02,232 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:27:02,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-05-12 12:27:02,232 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:27:02,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:27:02,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 1580909490, now seen corresponding path program 3 times
[2024-05-12 12:27:02,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:27:02,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037882205]
[2024-05-12 12:27:02,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:27:02,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:27:02,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:27:11,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-05-12 12:27:11,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:27:11,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037882205]
[2024-05-12 12:27:11,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037882205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:27:11,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:27:11,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:27:11,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260833969]
[2024-05-12 12:27:11,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:27:11,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:27:11,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:27:11,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:27:11,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:27:11,339 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:27:11,339 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 290 transitions, 3619 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:11,339 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:27:11,339 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:27:11,339 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:27:13,612 INFO  L124   PetriNetUnfolderBase]: 4505/7240 cut-off events.
[2024-05-12 12:27:13,612 INFO  L125   PetriNetUnfolderBase]: For 106639/106639 co-relation queries the response was YES.
[2024-05-12 12:27:13,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40187 conditions, 7240 events. 4505/7240 cut-off events. For 106639/106639 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 45467 event pairs, 1438 based on Foata normal form. 4/7038 useless extension candidates. Maximal degree in co-relation 40109. Up to 6162 conditions per place. 
[2024-05-12 12:27:13,686 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 277 selfloop transitions, 71 changer transitions 0/357 dead transitions.
[2024-05-12 12:27:13,687 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 357 transitions, 4608 flow
[2024-05-12 12:27:13,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:27:13,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:27:13,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions.
[2024-05-12 12:27:13,693 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5145833333333333
[2024-05-12 12:27:13,693 INFO  L175             Difference]: Start difference. First operand has 172 places, 290 transitions, 3619 flow. Second operand 10 states and 247 transitions.
[2024-05-12 12:27:13,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 357 transitions, 4608 flow
[2024-05-12 12:27:13,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 357 transitions, 4413 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-05-12 12:27:13,819 INFO  L231             Difference]: Finished difference. Result has 174 places, 293 transitions, 3645 flow
[2024-05-12 12:27:13,819 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3424, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3645, PETRI_PLACES=174, PETRI_TRANSITIONS=293}
[2024-05-12 12:27:13,819 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 120 predicate places.
[2024-05-12 12:27:13,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 293 transitions, 3645 flow
[2024-05-12 12:27:13,820 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:13,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:27:13,820 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:27:13,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-05-12 12:27:13,820 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:27:13,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:27:13,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -20846966, now seen corresponding path program 4 times
[2024-05-12 12:27:13,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:27:13,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487428800]
[2024-05-12 12:27:13,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:27:13,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:27:13,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:27:23,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:27:23,202 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:27:23,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487428800]
[2024-05-12 12:27:23,202 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487428800] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:27:23,202 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:27:23,202 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:27:23,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260991817]
[2024-05-12 12:27:23,203 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:27:23,203 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:27:23,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:27:23,203 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:27:23,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:27:23,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:27:23,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 293 transitions, 3645 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:23,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:27:23,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:27:23,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:27:25,475 INFO  L124   PetriNetUnfolderBase]: 4513/7236 cut-off events.
[2024-05-12 12:27:25,475 INFO  L125   PetriNetUnfolderBase]: For 113676/113676 co-relation queries the response was YES.
[2024-05-12 12:27:25,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40743 conditions, 7236 events. 4513/7236 cut-off events. For 113676/113676 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 45483 event pairs, 1350 based on Foata normal form. 4/7038 useless extension candidates. Maximal degree in co-relation 40664. Up to 6020 conditions per place. 
[2024-05-12 12:27:25,648 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 270 selfloop transitions, 83 changer transitions 0/362 dead transitions.
[2024-05-12 12:27:25,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 362 transitions, 4700 flow
[2024-05-12 12:27:25,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:27:25,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:27:25,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions.
[2024-05-12 12:27:25,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5145833333333333
[2024-05-12 12:27:25,649 INFO  L175             Difference]: Start difference. First operand has 174 places, 293 transitions, 3645 flow. Second operand 10 states and 247 transitions.
[2024-05-12 12:27:25,649 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 362 transitions, 4700 flow
[2024-05-12 12:27:25,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 362 transitions, 4505 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-05-12 12:27:25,774 INFO  L231             Difference]: Finished difference. Result has 177 places, 298 transitions, 3775 flow
[2024-05-12 12:27:25,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3450, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3775, PETRI_PLACES=177, PETRI_TRANSITIONS=298}
[2024-05-12 12:27:25,775 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 123 predicate places.
[2024-05-12 12:27:25,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 298 transitions, 3775 flow
[2024-05-12 12:27:25,775 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:25,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:27:25,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:27:25,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-05-12 12:27:25,776 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:27:25,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:27:25,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 1172582456, now seen corresponding path program 2 times
[2024-05-12 12:27:25,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:27:25,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064406970]
[2024-05-12 12:27:25,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:27:25,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:27:25,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:27:33,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:27:33,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:27:33,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064406970]
[2024-05-12 12:27:33,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064406970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:27:33,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:27:33,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:27:33,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130982216]
[2024-05-12 12:27:33,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:27:33,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:27:33,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:27:33,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:27:33,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:27:33,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:27:33,635 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 298 transitions, 3775 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:33,635 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:27:33,635 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:27:33,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:27:35,230 INFO  L124   PetriNetUnfolderBase]: 4134/6566 cut-off events.
[2024-05-12 12:27:35,230 INFO  L125   PetriNetUnfolderBase]: For 115181/115254 co-relation queries the response was YES.
[2024-05-12 12:27:35,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38283 conditions, 6566 events. 4134/6566 cut-off events. For 115181/115254 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 40474 event pairs, 1566 based on Foata normal form. 33/6381 useless extension candidates. Maximal degree in co-relation 38202. Up to 5683 conditions per place. 
[2024-05-12 12:27:35,292 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 263 selfloop transitions, 26 changer transitions 0/319 dead transitions.
[2024-05-12 12:27:35,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 319 transitions, 4465 flow
[2024-05-12 12:27:35,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:27:35,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:27:35,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-05-12 12:27:35,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5034722222222222
[2024-05-12 12:27:35,293 INFO  L175             Difference]: Start difference. First operand has 177 places, 298 transitions, 3775 flow. Second operand 6 states and 145 transitions.
[2024-05-12 12:27:35,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 319 transitions, 4465 flow
[2024-05-12 12:27:35,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 319 transitions, 4271 flow, removed 55 selfloop flow, removed 6 redundant places.
[2024-05-12 12:27:35,466 INFO  L231             Difference]: Finished difference. Result has 177 places, 298 transitions, 3641 flow
[2024-05-12 12:27:35,466 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3641, PETRI_PLACES=177, PETRI_TRANSITIONS=298}
[2024-05-12 12:27:35,466 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 123 predicate places.
[2024-05-12 12:27:35,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 298 transitions, 3641 flow
[2024-05-12 12:27:35,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:35,467 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:27:35,467 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:27:35,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-05-12 12:27:35,467 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:27:35,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:27:35,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 194744654, now seen corresponding path program 1 times
[2024-05-12 12:27:35,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:27:35,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117122057]
[2024-05-12 12:27:35,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:27:35,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:27:35,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:27:43,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:27:43,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:27:43,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117122057]
[2024-05-12 12:27:43,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117122057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:27:43,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:27:43,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:27:43,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247648661]
[2024-05-12 12:27:43,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:27:43,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:27:43,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:27:43,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:27:43,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:27:43,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:27:43,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 298 transitions, 3641 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:43,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:27:43,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:27:43,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:27:44,910 INFO  L124   PetriNetUnfolderBase]: 4517/7038 cut-off events.
[2024-05-12 12:27:44,910 INFO  L125   PetriNetUnfolderBase]: For 120363/120363 co-relation queries the response was YES.
[2024-05-12 12:27:44,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41241 conditions, 7038 events. 4517/7038 cut-off events. For 120363/120363 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 42811 event pairs, 1642 based on Foata normal form. 1/6900 useless extension candidates. Maximal degree in co-relation 41158. Up to 6428 conditions per place. 
[2024-05-12 12:27:44,982 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 304 selfloop transitions, 13 changer transitions 0/326 dead transitions.
[2024-05-12 12:27:44,982 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 326 transitions, 4452 flow
[2024-05-12 12:27:44,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:27:44,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:27:44,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-05-12 12:27:44,983 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4756944444444444
[2024-05-12 12:27:44,983 INFO  L175             Difference]: Start difference. First operand has 177 places, 298 transitions, 3641 flow. Second operand 6 states and 137 transitions.
[2024-05-12 12:27:44,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 326 transitions, 4452 flow
[2024-05-12 12:27:45,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 326 transitions, 4382 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-05-12 12:27:45,152 INFO  L231             Difference]: Finished difference. Result has 179 places, 305 transitions, 3705 flow
[2024-05-12 12:27:45,153 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3571, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3705, PETRI_PLACES=179, PETRI_TRANSITIONS=305}
[2024-05-12 12:27:45,153 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 125 predicate places.
[2024-05-12 12:27:45,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 305 transitions, 3705 flow
[2024-05-12 12:27:45,153 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:45,153 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:27:45,153 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:27:45,153 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-05-12 12:27:45,154 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:27:45,154 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:27:45,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 2051963432, now seen corresponding path program 2 times
[2024-05-12 12:27:45,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:27:45,154 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134828911]
[2024-05-12 12:27:45,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:27:45,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:27:45,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:27:53,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:27:53,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:27:53,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134828911]
[2024-05-12 12:27:53,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134828911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:27:53,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:27:53,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 12:27:53,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349227763]
[2024-05-12 12:27:53,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:27:53,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 12:27:53,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:27:53,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 12:27:53,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 12:27:53,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:27:53,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 305 transitions, 3705 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:53,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:27:53,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:27:53,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:27:54,876 INFO  L124   PetriNetUnfolderBase]: 4522/7055 cut-off events.
[2024-05-12 12:27:54,876 INFO  L125   PetriNetUnfolderBase]: For 126484/126492 co-relation queries the response was YES.
[2024-05-12 12:27:54,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42105 conditions, 7055 events. 4522/7055 cut-off events. For 126484/126492 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 43023 event pairs, 1624 based on Foata normal form. 9/6925 useless extension candidates. Maximal degree in co-relation 42020. Up to 6412 conditions per place. 
[2024-05-12 12:27:54,946 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 302 selfloop transitions, 18 changer transitions 0/329 dead transitions.
[2024-05-12 12:27:54,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 329 transitions, 4499 flow
[2024-05-12 12:27:54,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 12:27:54,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 12:27:54,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-05-12 12:27:54,947 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-05-12 12:27:54,947 INFO  L175             Difference]: Start difference. First operand has 179 places, 305 transitions, 3705 flow. Second operand 6 states and 138 transitions.
[2024-05-12 12:27:54,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 329 transitions, 4499 flow
[2024-05-12 12:27:55,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 329 transitions, 4456 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-05-12 12:27:55,140 INFO  L231             Difference]: Finished difference. Result has 182 places, 308 transitions, 3748 flow
[2024-05-12 12:27:55,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3662, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3748, PETRI_PLACES=182, PETRI_TRANSITIONS=308}
[2024-05-12 12:27:55,140 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 128 predicate places.
[2024-05-12 12:27:55,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 308 transitions, 3748 flow
[2024-05-12 12:27:55,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:27:55,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:27:55,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:27:55,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-05-12 12:27:55,141 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:27:55,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:27:55,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 2051972360, now seen corresponding path program 1 times
[2024-05-12 12:27:55,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:27:55,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607187054]
[2024-05-12 12:27:55,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:27:55,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:27:55,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:28:03,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:28:03,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:28:03,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607187054]
[2024-05-12 12:28:03,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607187054] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:28:03,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:28:03,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:28:03,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376054471]
[2024-05-12 12:28:03,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:28:03,685 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:28:03,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:28:03,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:28:03,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:28:03,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:28:03,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 308 transitions, 3748 flow. Second operand  has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:03,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:28:03,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:28:03,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:28:05,544 INFO  L124   PetriNetUnfolderBase]: 4208/6653 cut-off events.
[2024-05-12 12:28:05,544 INFO  L125   PetriNetUnfolderBase]: For 128269/128355 co-relation queries the response was YES.
[2024-05-12 12:28:05,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40303 conditions, 6653 events. 4208/6653 cut-off events. For 128269/128355 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 40877 event pairs, 1544 based on Foata normal form. 42/6469 useless extension candidates. Maximal degree in co-relation 40217. Up to 5729 conditions per place. 
[2024-05-12 12:28:05,610 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 277 selfloop transitions, 32 changer transitions 0/339 dead transitions.
[2024-05-12 12:28:05,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 339 transitions, 4576 flow
[2024-05-12 12:28:05,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:28:05,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:28:05,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions.
[2024-05-12 12:28:05,611 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 12:28:05,611 INFO  L175             Difference]: Start difference. First operand has 182 places, 308 transitions, 3748 flow. Second operand 7 states and 168 transitions.
[2024-05-12 12:28:05,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 339 transitions, 4576 flow
[2024-05-12 12:28:05,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 339 transitions, 4516 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-05-12 12:28:05,809 INFO  L231             Difference]: Finished difference. Result has 185 places, 313 transitions, 3844 flow
[2024-05-12 12:28:05,809 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3688, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3844, PETRI_PLACES=185, PETRI_TRANSITIONS=313}
[2024-05-12 12:28:05,809 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 131 predicate places.
[2024-05-12 12:28:05,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 313 transitions, 3844 flow
[2024-05-12 12:28:05,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:05,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:28:05,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:28:05,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-05-12 12:28:05,810 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:28:05,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:28:05,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -139833452, now seen corresponding path program 1 times
[2024-05-12 12:28:05,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:28:05,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331042523]
[2024-05-12 12:28:05,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:28:05,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:28:05,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:28:15,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:28:15,435 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:28:15,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331042523]
[2024-05-12 12:28:15,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331042523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:28:15,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:28:15,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:28:15,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539137369]
[2024-05-12 12:28:15,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:28:15,436 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:28:15,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:28:15,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:28:15,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:28:15,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:28:15,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 313 transitions, 3844 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:15,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:28:15,572 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:28:15,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:28:17,776 INFO  L124   PetriNetUnfolderBase]: 4840/7745 cut-off events.
[2024-05-12 12:28:17,777 INFO  L125   PetriNetUnfolderBase]: For 151452/151452 co-relation queries the response was YES.
[2024-05-12 12:28:17,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48198 conditions, 7745 events. 4840/7745 cut-off events. For 151452/151452 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 48757 event pairs, 1626 based on Foata normal form. 4/7535 useless extension candidates. Maximal degree in co-relation 48111. Up to 6578 conditions per place. 
[2024-05-12 12:28:17,851 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 319 selfloop transitions, 99 changer transitions 0/427 dead transitions.
[2024-05-12 12:28:17,851 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 427 transitions, 5866 flow
[2024-05-12 12:28:17,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:28:17,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:28:17,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions.
[2024-05-12 12:28:17,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-05-12 12:28:17,852 INFO  L175             Difference]: Start difference. First operand has 185 places, 313 transitions, 3844 flow. Second operand 9 states and 228 transitions.
[2024-05-12 12:28:17,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 427 transitions, 5866 flow
[2024-05-12 12:28:18,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 427 transitions, 5742 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-05-12 12:28:18,030 INFO  L231             Difference]: Finished difference. Result has 192 places, 362 transitions, 4823 flow
[2024-05-12 12:28:18,031 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3732, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4823, PETRI_PLACES=192, PETRI_TRANSITIONS=362}
[2024-05-12 12:28:18,031 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 138 predicate places.
[2024-05-12 12:28:18,031 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 362 transitions, 4823 flow
[2024-05-12 12:28:18,031 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:18,031 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:28:18,031 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:28:18,031 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-05-12 12:28:18,031 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:28:18,031 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:28:18,032 INFO  L85        PathProgramCache]: Analyzing trace with hash 101911108, now seen corresponding path program 2 times
[2024-05-12 12:28:18,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:28:18,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752773731]
[2024-05-12 12:28:18,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:28:18,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:28:18,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:28:28,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:28:28,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:28:28,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752773731]
[2024-05-12 12:28:28,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752773731] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:28:28,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:28:28,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:28:28,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423543426]
[2024-05-12 12:28:28,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:28:28,028 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:28:28,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:28:28,028 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:28:28,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:28:28,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:28:28,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 362 transitions, 4823 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:28,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:28:28,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:28:28,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:28:30,445 INFO  L124   PetriNetUnfolderBase]: 4932/7907 cut-off events.
[2024-05-12 12:28:30,446 INFO  L125   PetriNetUnfolderBase]: For 168884/168884 co-relation queries the response was YES.
[2024-05-12 12:28:30,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50621 conditions, 7907 events. 4932/7907 cut-off events. For 168884/168884 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50019 event pairs, 1213 based on Foata normal form. 4/7687 useless extension candidates. Maximal degree in co-relation 50530. Up to 6502 conditions per place. 
[2024-05-12 12:28:30,519 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 281 selfloop transitions, 125 changer transitions 0/415 dead transitions.
[2024-05-12 12:28:30,519 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 415 transitions, 6095 flow
[2024-05-12 12:28:30,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:28:30,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:28:30,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions.
[2024-05-12 12:28:30,520 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5234375
[2024-05-12 12:28:30,520 INFO  L175             Difference]: Start difference. First operand has 192 places, 362 transitions, 4823 flow. Second operand 8 states and 201 transitions.
[2024-05-12 12:28:30,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 415 transitions, 6095 flow
[2024-05-12 12:28:30,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 415 transitions, 6031 flow, removed 26 selfloop flow, removed 2 redundant places.
[2024-05-12 12:28:30,739 INFO  L231             Difference]: Finished difference. Result has 198 places, 366 transitions, 5135 flow
[2024-05-12 12:28:30,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4759, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5135, PETRI_PLACES=198, PETRI_TRANSITIONS=366}
[2024-05-12 12:28:30,739 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 144 predicate places.
[2024-05-12 12:28:30,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 366 transitions, 5135 flow
[2024-05-12 12:28:30,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:30,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:28:30,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:28:30,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-05-12 12:28:30,740 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:28:30,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:28:30,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 1856371028, now seen corresponding path program 3 times
[2024-05-12 12:28:30,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:28:30,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029833135]
[2024-05-12 12:28:30,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:28:30,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:28:30,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:28:40,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:28:40,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:28:40,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029833135]
[2024-05-12 12:28:40,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029833135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:28:40,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:28:40,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:28:40,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35916938]
[2024-05-12 12:28:40,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:28:40,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:28:40,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:28:40,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:28:40,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:28:40,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:28:40,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 366 transitions, 5135 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:40,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:28:40,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:28:40,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:28:42,470 INFO  L124   PetriNetUnfolderBase]: 4916/7901 cut-off events.
[2024-05-12 12:28:42,470 INFO  L125   PetriNetUnfolderBase]: For 174673/174673 co-relation queries the response was YES.
[2024-05-12 12:28:42,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50999 conditions, 7901 events. 4916/7901 cut-off events. For 174673/174673 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 50233 event pairs, 1549 based on Foata normal form. 8/7679 useless extension candidates. Maximal degree in co-relation 50906. Up to 6695 conditions per place. 
[2024-05-12 12:28:42,539 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 277 selfloop transitions, 117 changer transitions 0/403 dead transitions.
[2024-05-12 12:28:42,539 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 403 transitions, 6095 flow
[2024-05-12 12:28:42,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:28:42,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:28:42,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions.
[2024-05-12 12:28:42,540 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5178571428571429
[2024-05-12 12:28:42,540 INFO  L175             Difference]: Start difference. First operand has 198 places, 366 transitions, 5135 flow. Second operand 7 states and 174 transitions.
[2024-05-12 12:28:42,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 403 transitions, 6095 flow
[2024-05-12 12:28:42,799 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 403 transitions, 5864 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-05-12 12:28:42,804 INFO  L231             Difference]: Finished difference. Result has 200 places, 366 transitions, 5159 flow
[2024-05-12 12:28:42,804 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4904, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5159, PETRI_PLACES=200, PETRI_TRANSITIONS=366}
[2024-05-12 12:28:42,804 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 146 predicate places.
[2024-05-12 12:28:42,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 366 transitions, 5159 flow
[2024-05-12 12:28:42,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:42,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:28:42,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:28:42,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-05-12 12:28:42,805 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:28:42,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:28:42,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 385698372, now seen corresponding path program 4 times
[2024-05-12 12:28:42,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:28:42,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518794535]
[2024-05-12 12:28:42,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:28:42,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:28:42,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:28:52,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:28:52,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:28:52,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518794535]
[2024-05-12 12:28:52,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518794535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:28:52,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:28:52,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:28:52,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240578334]
[2024-05-12 12:28:52,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:28:52,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:28:52,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:28:52,359 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:28:52,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:28:52,489 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:28:52,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 366 transitions, 5159 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:52,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:28:52,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:28:52,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:28:54,708 INFO  L124   PetriNetUnfolderBase]: 4958/7955 cut-off events.
[2024-05-12 12:28:54,708 INFO  L125   PetriNetUnfolderBase]: For 169102/169110 co-relation queries the response was YES.
[2024-05-12 12:28:54,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50955 conditions, 7955 events. 4958/7955 cut-off events. For 169102/169110 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 50507 event pairs, 1523 based on Foata normal form. 12/7741 useless extension candidates. Maximal degree in co-relation 50861. Up to 6728 conditions per place. 
[2024-05-12 12:28:54,778 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 255 selfloop transitions, 150 changer transitions 0/414 dead transitions.
[2024-05-12 12:28:54,778 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 414 transitions, 6241 flow
[2024-05-12 12:28:54,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:28:54,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:28:54,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions.
[2024-05-12 12:28:54,779 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208333333333334
[2024-05-12 12:28:54,779 INFO  L175             Difference]: Start difference. First operand has 200 places, 366 transitions, 5159 flow. Second operand 8 states and 200 transitions.
[2024-05-12 12:28:54,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 414 transitions, 6241 flow
[2024-05-12 12:28:55,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 414 transitions, 5987 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-05-12 12:28:55,057 INFO  L231             Difference]: Finished difference. Result has 202 places, 368 transitions, 5275 flow
[2024-05-12 12:28:55,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4905, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5275, PETRI_PLACES=202, PETRI_TRANSITIONS=368}
[2024-05-12 12:28:55,057 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 148 predicate places.
[2024-05-12 12:28:55,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 368 transitions, 5275 flow
[2024-05-12 12:28:55,058 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:28:55,058 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:28:55,058 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:28:55,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-05-12 12:28:55,058 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:28:55,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:28:55,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -1362373612, now seen corresponding path program 5 times
[2024-05-12 12:28:55,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:28:55,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615582790]
[2024-05-12 12:28:55,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:28:55,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:28:55,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:29:03,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:29:03,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:29:03,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615582790]
[2024-05-12 12:29:03,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615582790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:29:03,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:29:03,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:29:03,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667041209]
[2024-05-12 12:29:03,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:29:03,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:29:03,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:29:03,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:29:03,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:29:03,635 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:29:03,635 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 368 transitions, 5275 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:03,635 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:29:03,635 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:29:03,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:29:05,894 INFO  L124   PetriNetUnfolderBase]: 4950/7818 cut-off events.
[2024-05-12 12:29:05,894 INFO  L125   PetriNetUnfolderBase]: For 175128/175128 co-relation queries the response was YES.
[2024-05-12 12:29:05,939 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51165 conditions, 7818 events. 4950/7818 cut-off events. For 175128/175128 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 49072 event pairs, 1523 based on Foata normal form. 4/7637 useless extension candidates. Maximal degree in co-relation 51070. Up to 6716 conditions per place. 
[2024-05-12 12:29:05,971 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 270 selfloop transitions, 151 changer transitions 0/430 dead transitions.
[2024-05-12 12:29:05,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 430 transitions, 6449 flow
[2024-05-12 12:29:05,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:29:05,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:29:05,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions.
[2024-05-12 12:29:05,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5125
[2024-05-12 12:29:05,972 INFO  L175             Difference]: Start difference. First operand has 202 places, 368 transitions, 5275 flow. Second operand 10 states and 246 transitions.
[2024-05-12 12:29:05,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 430 transitions, 6449 flow
[2024-05-12 12:29:06,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 430 transitions, 6117 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-05-12 12:29:06,220 INFO  L231             Difference]: Finished difference. Result has 206 places, 370 transitions, 5319 flow
[2024-05-12 12:29:06,220 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4943, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5319, PETRI_PLACES=206, PETRI_TRANSITIONS=370}
[2024-05-12 12:29:06,221 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 152 predicate places.
[2024-05-12 12:29:06,221 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 370 transitions, 5319 flow
[2024-05-12 12:29:06,221 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:06,221 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:29:06,221 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:29:06,221 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-05-12 12:29:06,221 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:29:06,221 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:29:06,221 INFO  L85        PathProgramCache]: Analyzing trace with hash 1741997061, now seen corresponding path program 1 times
[2024-05-12 12:29:06,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:29:06,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602866458]
[2024-05-12 12:29:06,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:29:06,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:29:06,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:29:13,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:29:13,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:29:13,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602866458]
[2024-05-12 12:29:13,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602866458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:29:13,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:29:13,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:29:13,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190515766]
[2024-05-12 12:29:13,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:29:13,725 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:29:13,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:29:13,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:29:13,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:29:13,816 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:29:13,816 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 370 transitions, 5319 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:13,816 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:29:13,816 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:29:13,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:29:15,818 INFO  L124   PetriNetUnfolderBase]: 4983/7792 cut-off events.
[2024-05-12 12:29:15,818 INFO  L125   PetriNetUnfolderBase]: For 181283/181283 co-relation queries the response was YES.
[2024-05-12 12:29:15,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51609 conditions, 7792 events. 4983/7792 cut-off events. For 181283/181283 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 48208 event pairs, 1574 based on Foata normal form. 2/7631 useless extension candidates. Maximal degree in co-relation 51513. Up to 7053 conditions per place. 
[2024-05-12 12:29:15,895 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 373 selfloop transitions, 31 changer transitions 0/413 dead transitions.
[2024-05-12 12:29:15,895 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 413 transitions, 6403 flow
[2024-05-12 12:29:15,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:29:15,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:29:15,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions.
[2024-05-12 12:29:15,896 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4652777777777778
[2024-05-12 12:29:15,896 INFO  L175             Difference]: Start difference. First operand has 206 places, 370 transitions, 5319 flow. Second operand 9 states and 201 transitions.
[2024-05-12 12:29:15,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 413 transitions, 6403 flow
[2024-05-12 12:29:16,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 413 transitions, 6065 flow, removed 21 selfloop flow, removed 8 redundant places.
[2024-05-12 12:29:16,180 INFO  L231             Difference]: Finished difference. Result has 208 places, 379 transitions, 5197 flow
[2024-05-12 12:29:16,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4981, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5197, PETRI_PLACES=208, PETRI_TRANSITIONS=379}
[2024-05-12 12:29:16,180 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 154 predicate places.
[2024-05-12 12:29:16,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 379 transitions, 5197 flow
[2024-05-12 12:29:16,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:16,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:29:16,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:29:16,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-05-12 12:29:16,181 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:29:16,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:29:16,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 1742117961, now seen corresponding path program 2 times
[2024-05-12 12:29:16,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:29:16,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062510550]
[2024-05-12 12:29:16,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:29:16,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:29:16,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:29:23,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:29:23,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:29:23,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062510550]
[2024-05-12 12:29:23,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062510550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:29:23,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:29:23,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:29:23,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085824318]
[2024-05-12 12:29:23,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:29:23,547 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:29:23,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:29:23,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:29:23,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:29:23,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:29:23,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 379 transitions, 5197 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:23,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:29:23,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:29:23,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:29:25,867 INFO  L124   PetriNetUnfolderBase]: 5037/7868 cut-off events.
[2024-05-12 12:29:25,868 INFO  L125   PetriNetUnfolderBase]: For 189777/189777 co-relation queries the response was YES.
[2024-05-12 12:29:25,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53176 conditions, 7868 events. 5037/7868 cut-off events. For 189777/189777 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 48534 event pairs, 1559 based on Foata normal form. 2/7711 useless extension candidates. Maximal degree in co-relation 53078. Up to 7085 conditions per place. 
[2024-05-12 12:29:25,939 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 376 selfloop transitions, 40 changer transitions 0/425 dead transitions.
[2024-05-12 12:29:25,939 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 425 transitions, 6449 flow
[2024-05-12 12:29:25,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:29:25,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:29:25,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions.
[2024-05-12 12:29:25,940 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4652777777777778
[2024-05-12 12:29:25,940 INFO  L175             Difference]: Start difference. First operand has 208 places, 379 transitions, 5197 flow. Second operand 9 states and 201 transitions.
[2024-05-12 12:29:25,940 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 425 transitions, 6449 flow
[2024-05-12 12:29:26,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 425 transitions, 6334 flow, removed 37 selfloop flow, removed 5 redundant places.
[2024-05-12 12:29:26,192 INFO  L231             Difference]: Finished difference. Result has 213 places, 391 transitions, 5394 flow
[2024-05-12 12:29:26,193 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5082, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5394, PETRI_PLACES=213, PETRI_TRANSITIONS=391}
[2024-05-12 12:29:26,193 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 159 predicate places.
[2024-05-12 12:29:26,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 391 transitions, 5394 flow
[2024-05-12 12:29:26,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:26,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:29:26,194 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:29:26,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-05-12 12:29:26,194 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:29:26,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:29:26,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -991695928, now seen corresponding path program 1 times
[2024-05-12 12:29:26,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:29:26,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667308155]
[2024-05-12 12:29:26,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:29:26,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:29:26,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:29:33,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:29:33,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:29:33,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667308155]
[2024-05-12 12:29:33,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667308155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:29:33,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:29:33,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:29:33,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294339378]
[2024-05-12 12:29:33,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:29:33,425 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:29:33,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:29:33,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:29:33,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:29:33,519 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:29:33,520 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 391 transitions, 5394 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:33,520 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:29:33,520 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:29:33,520 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:29:35,602 INFO  L124   PetriNetUnfolderBase]: 5125/8000 cut-off events.
[2024-05-12 12:29:35,602 INFO  L125   PetriNetUnfolderBase]: For 205851/205851 co-relation queries the response was YES.
[2024-05-12 12:29:35,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55414 conditions, 8000 events. 5125/8000 cut-off events. For 205851/205851 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 49486 event pairs, 1522 based on Foata normal form. 2/7836 useless extension candidates. Maximal degree in co-relation 55315. Up to 7154 conditions per place. 
[2024-05-12 12:29:35,675 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 395 selfloop transitions, 36 changer transitions 0/440 dead transitions.
[2024-05-12 12:29:35,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 440 transitions, 6882 flow
[2024-05-12 12:29:35,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:29:35,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:29:35,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-05-12 12:29:35,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-05-12 12:29:35,676 INFO  L175             Difference]: Start difference. First operand has 213 places, 391 transitions, 5394 flow. Second operand 7 states and 164 transitions.
[2024-05-12 12:29:35,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 440 transitions, 6882 flow
[2024-05-12 12:29:35,953 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 440 transitions, 6739 flow, removed 54 selfloop flow, removed 6 redundant places.
[2024-05-12 12:29:35,958 INFO  L231             Difference]: Finished difference. Result has 217 places, 411 transitions, 5770 flow
[2024-05-12 12:29:35,958 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5263, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5770, PETRI_PLACES=217, PETRI_TRANSITIONS=411}
[2024-05-12 12:29:35,959 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 163 predicate places.
[2024-05-12 12:29:35,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 411 transitions, 5770 flow
[2024-05-12 12:29:35,959 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:35,959 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:29:35,959 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:29:35,959 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-05-12 12:29:35,959 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:29:35,959 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:29:35,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -1661598715, now seen corresponding path program 3 times
[2024-05-12 12:29:35,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:29:35,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133469305]
[2024-05-12 12:29:35,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:29:35,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:29:35,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:29:44,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:29:44,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:29:44,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133469305]
[2024-05-12 12:29:44,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133469305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:29:44,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:29:44,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:29:44,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640550074]
[2024-05-12 12:29:44,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:29:44,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:29:44,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:29:44,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:29:44,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:29:44,161 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:29:44,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 411 transitions, 5770 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:44,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:29:44,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:29:44,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:29:46,241 INFO  L124   PetriNetUnfolderBase]: 5119/8026 cut-off events.
[2024-05-12 12:29:46,242 INFO  L125   PetriNetUnfolderBase]: For 217308/217314 co-relation queries the response was YES.
[2024-05-12 12:29:46,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56771 conditions, 8026 events. 5119/8026 cut-off events. For 217308/217314 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 49836 event pairs, 1536 based on Foata normal form. 8/7863 useless extension candidates. Maximal degree in co-relation 56668. Up to 7158 conditions per place. 
[2024-05-12 12:29:46,328 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 398 selfloop transitions, 54 changer transitions 0/461 dead transitions.
[2024-05-12 12:29:46,328 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 461 transitions, 7215 flow
[2024-05-12 12:29:46,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:29:46,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:29:46,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions.
[2024-05-12 12:29:46,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.484375
[2024-05-12 12:29:46,333 INFO  L175             Difference]: Start difference. First operand has 217 places, 411 transitions, 5770 flow. Second operand 8 states and 186 transitions.
[2024-05-12 12:29:46,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 461 transitions, 7215 flow
[2024-05-12 12:29:46,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 461 transitions, 7155 flow, removed 29 selfloop flow, removed 1 redundant places.
[2024-05-12 12:29:46,811 INFO  L231             Difference]: Finished difference. Result has 226 places, 429 transitions, 6199 flow
[2024-05-12 12:29:46,811 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5710, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6199, PETRI_PLACES=226, PETRI_TRANSITIONS=429}
[2024-05-12 12:29:46,812 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 172 predicate places.
[2024-05-12 12:29:46,812 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 429 transitions, 6199 flow
[2024-05-12 12:29:46,812 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:46,812 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:29:46,812 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:29:46,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-05-12 12:29:46,812 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:29:46,812 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:29:46,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -813641848, now seen corresponding path program 2 times
[2024-05-12 12:29:46,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:29:46,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952819336]
[2024-05-12 12:29:46,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:29:46,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:29:46,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:29:54,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:29:54,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:29:54,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952819336]
[2024-05-12 12:29:54,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952819336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:29:54,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:29:54,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:29:54,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154405775]
[2024-05-12 12:29:54,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:29:54,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:29:54,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:29:54,597 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:29:54,597 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:29:54,751 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:29:54,751 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 429 transitions, 6199 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:54,751 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:29:54,751 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:29:54,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:29:56,847 INFO  L124   PetriNetUnfolderBase]: 5185/8108 cut-off events.
[2024-05-12 12:29:56,847 INFO  L125   PetriNetUnfolderBase]: For 239632/239638 co-relation queries the response was YES.
[2024-05-12 12:29:56,898 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59051 conditions, 8108 events. 5185/8108 cut-off events. For 239632/239638 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 50343 event pairs, 1515 based on Foata normal form. 8/7943 useless extension candidates. Maximal degree in co-relation 58943. Up to 7035 conditions per place. 
[2024-05-12 12:29:56,933 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 420 selfloop transitions, 49 changer transitions 0/478 dead transitions.
[2024-05-12 12:29:56,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 478 transitions, 7821 flow
[2024-05-12 12:29:56,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:29:56,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:29:56,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions.
[2024-05-12 12:29:56,934 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49702380952380953
[2024-05-12 12:29:56,934 INFO  L175             Difference]: Start difference. First operand has 226 places, 429 transitions, 6199 flow. Second operand 7 states and 167 transitions.
[2024-05-12 12:29:56,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 478 transitions, 7821 flow
[2024-05-12 12:29:57,345 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 478 transitions, 7587 flow, removed 104 selfloop flow, removed 3 redundant places.
[2024-05-12 12:29:57,350 INFO  L231             Difference]: Finished difference. Result has 232 places, 443 transitions, 6357 flow
[2024-05-12 12:29:57,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5997, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6357, PETRI_PLACES=232, PETRI_TRANSITIONS=443}
[2024-05-12 12:29:57,351 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 178 predicate places.
[2024-05-12 12:29:57,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 443 transitions, 6357 flow
[2024-05-12 12:29:57,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:29:57,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:29:57,351 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:29:57,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-05-12 12:29:57,352 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:29:57,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:29:57,352 INFO  L85        PathProgramCache]: Analyzing trace with hash -813634408, now seen corresponding path program 3 times
[2024-05-12 12:29:57,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:29:57,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758551430]
[2024-05-12 12:29:57,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:29:57,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:29:57,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:30:04,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:30:04,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:30:04,715 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758551430]
[2024-05-12 12:30:04,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758551430] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:30:04,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:30:04,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:30:04,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108976697]
[2024-05-12 12:30:04,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:30:04,715 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:30:04,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:30:04,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:30:04,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:30:04,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:30:04,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 443 transitions, 6357 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:04,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:30:04,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:30:04,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:30:06,998 INFO  L124   PetriNetUnfolderBase]: 5202/8149 cut-off events.
[2024-05-12 12:30:06,998 INFO  L125   PetriNetUnfolderBase]: For 253124/253130 co-relation queries the response was YES.
[2024-05-12 12:30:07,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60864 conditions, 8149 events. 5202/8149 cut-off events. For 253124/253130 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 50799 event pairs, 1507 based on Foata normal form. 8/7980 useless extension candidates. Maximal degree in co-relation 60752. Up to 7054 conditions per place. 
[2024-05-12 12:30:07,098 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 413 selfloop transitions, 59 changer transitions 0/481 dead transitions.
[2024-05-12 12:30:07,098 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 481 transitions, 7763 flow
[2024-05-12 12:30:07,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:30:07,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:30:07,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-05-12 12:30:07,099 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-05-12 12:30:07,099 INFO  L175             Difference]: Start difference. First operand has 232 places, 443 transitions, 6357 flow. Second operand 7 states and 166 transitions.
[2024-05-12 12:30:07,099 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 481 transitions, 7763 flow
[2024-05-12 12:30:07,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 481 transitions, 7629 flow, removed 56 selfloop flow, removed 2 redundant places.
[2024-05-12 12:30:07,487 INFO  L231             Difference]: Finished difference. Result has 238 places, 450 transitions, 6513 flow
[2024-05-12 12:30:07,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6247, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6513, PETRI_PLACES=238, PETRI_TRANSITIONS=450}
[2024-05-12 12:30:07,487 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 184 predicate places.
[2024-05-12 12:30:07,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 450 transitions, 6513 flow
[2024-05-12 12:30:07,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:07,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:30:07,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:30:07,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-05-12 12:30:07,490 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:30:07,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:30:07,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 900816166, now seen corresponding path program 1 times
[2024-05-12 12:30:07,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:30:07,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427139352]
[2024-05-12 12:30:07,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:30:07,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:30:07,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:30:15,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:30:15,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:30:15,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427139352]
[2024-05-12 12:30:15,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427139352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:30:15,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:30:15,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:30:15,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513176964]
[2024-05-12 12:30:15,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:30:15,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:30:15,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:30:15,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:30:15,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:30:15,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:30:15,870 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 450 transitions, 6513 flow. Second operand  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:15,870 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:30:15,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:30:15,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:30:18,099 INFO  L124   PetriNetUnfolderBase]: 5033/7976 cut-off events.
[2024-05-12 12:30:18,099 INFO  L125   PetriNetUnfolderBase]: For 256630/256690 co-relation queries the response was YES.
[2024-05-12 12:30:18,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59034 conditions, 7976 events. 5033/7976 cut-off events. For 256630/256690 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 50260 event pairs, 1441 based on Foata normal form. 33/7746 useless extension candidates. Maximal degree in co-relation 58919. Up to 6612 conditions per place. 
[2024-05-12 12:30:18,196 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 396 selfloop transitions, 50 changer transitions 0/489 dead transitions.
[2024-05-12 12:30:18,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 489 transitions, 7732 flow
[2024-05-12 12:30:18,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:30:18,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:30:18,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions.
[2024-05-12 12:30:18,197 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026041666666666
[2024-05-12 12:30:18,197 INFO  L175             Difference]: Start difference. First operand has 238 places, 450 transitions, 6513 flow. Second operand 8 states and 193 transitions.
[2024-05-12 12:30:18,197 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 489 transitions, 7732 flow
[2024-05-12 12:30:18,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 489 transitions, 7642 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-05-12 12:30:18,621 INFO  L231             Difference]: Finished difference. Result has 243 places, 453 transitions, 6616 flow
[2024-05-12 12:30:18,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6423, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6616, PETRI_PLACES=243, PETRI_TRANSITIONS=453}
[2024-05-12 12:30:18,622 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 189 predicate places.
[2024-05-12 12:30:18,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 453 transitions, 6616 flow
[2024-05-12 12:30:18,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:18,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:30:18,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:30:18,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-05-12 12:30:18,622 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:30:18,622 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:30:18,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -2021209431, now seen corresponding path program 1 times
[2024-05-12 12:30:18,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:30:18,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808622560]
[2024-05-12 12:30:18,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:30:18,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:30:18,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:30:27,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:30:27,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:30:27,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808622560]
[2024-05-12 12:30:27,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808622560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:30:27,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:30:27,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:30:27,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934068676]
[2024-05-12 12:30:27,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:30:27,615 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:30:27,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:30:27,616 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:30:27,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:30:27,855 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:30:27,855 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 453 transitions, 6616 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:27,855 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:30:27,855 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:30:27,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:30:30,741 INFO  L124   PetriNetUnfolderBase]: 5856/9338 cut-off events.
[2024-05-12 12:30:30,741 INFO  L125   PetriNetUnfolderBase]: For 323118/323118 co-relation queries the response was YES.
[2024-05-12 12:30:30,804 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70213 conditions, 9338 events. 5856/9338 cut-off events. For 323118/323118 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 60391 event pairs, 1079 based on Foata normal form. 16/9112 useless extension candidates. Maximal degree in co-relation 70097. Up to 7079 conditions per place. 
[2024-05-12 12:30:30,847 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 402 selfloop transitions, 150 changer transitions 0/561 dead transitions.
[2024-05-12 12:30:30,847 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 561 transitions, 8906 flow
[2024-05-12 12:30:30,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:30:30,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:30:30,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions.
[2024-05-12 12:30:30,848 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-05-12 12:30:30,848 INFO  L175             Difference]: Start difference. First operand has 243 places, 453 transitions, 6616 flow. Second operand 9 states and 234 transitions.
[2024-05-12 12:30:30,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 561 transitions, 8906 flow
[2024-05-12 12:30:31,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 561 transitions, 8759 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-05-12 12:30:31,383 INFO  L231             Difference]: Finished difference. Result has 249 places, 489 transitions, 7636 flow
[2024-05-12 12:30:31,384 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6469, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7636, PETRI_PLACES=249, PETRI_TRANSITIONS=489}
[2024-05-12 12:30:31,384 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 195 predicate places.
[2024-05-12 12:30:31,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 489 transitions, 7636 flow
[2024-05-12 12:30:31,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:31,384 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:30:31,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:30:31,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-05-12 12:30:31,385 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:30:31,385 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:30:31,385 INFO  L85        PathProgramCache]: Analyzing trace with hash 1712928453, now seen corresponding path program 2 times
[2024-05-12 12:30:31,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:30:31,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015476747]
[2024-05-12 12:30:31,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:30:31,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:30:31,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:30:39,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:30:39,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:30:39,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015476747]
[2024-05-12 12:30:39,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015476747] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:30:39,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:30:39,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:30:39,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662863225]
[2024-05-12 12:30:39,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:30:39,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:30:39,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:30:39,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:30:39,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:30:39,566 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:30:39,566 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 489 transitions, 7636 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:39,566 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:30:39,567 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:30:39,567 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:30:42,454 INFO  L124   PetriNetUnfolderBase]: 6048/9626 cut-off events.
[2024-05-12 12:30:42,455 INFO  L125   PetriNetUnfolderBase]: For 357535/357535 co-relation queries the response was YES.
[2024-05-12 12:30:42,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75039 conditions, 9626 events. 6048/9626 cut-off events. For 357535/357535 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 62304 event pairs, 1490 based on Foata normal form. 16/9398 useless extension candidates. Maximal degree in co-relation 74919. Up to 7721 conditions per place. 
[2024-05-12 12:30:42,747 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 443 selfloop transitions, 101 changer transitions 0/553 dead transitions.
[2024-05-12 12:30:42,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 553 transitions, 9378 flow
[2024-05-12 12:30:42,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:30:42,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:30:42,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions.
[2024-05-12 12:30:42,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5442708333333334
[2024-05-12 12:30:42,748 INFO  L175             Difference]: Start difference. First operand has 249 places, 489 transitions, 7636 flow. Second operand 8 states and 209 transitions.
[2024-05-12 12:30:42,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 553 transitions, 9378 flow
[2024-05-12 12:30:43,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 553 transitions, 9129 flow, removed 92 selfloop flow, removed 3 redundant places.
[2024-05-12 12:30:43,402 INFO  L231             Difference]: Finished difference. Result has 255 places, 497 transitions, 7862 flow
[2024-05-12 12:30:43,402 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7399, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7862, PETRI_PLACES=255, PETRI_TRANSITIONS=497}
[2024-05-12 12:30:43,402 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 201 predicate places.
[2024-05-12 12:30:43,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 497 transitions, 7862 flow
[2024-05-12 12:30:43,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:43,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:30:43,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:30:43,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-05-12 12:30:43,403 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:30:43,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:30:43,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -1047007885, now seen corresponding path program 3 times
[2024-05-12 12:30:43,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:30:43,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225375496]
[2024-05-12 12:30:43,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:30:43,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:30:43,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:30:52,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:30:52,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:30:52,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225375496]
[2024-05-12 12:30:52,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225375496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:30:52,482 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:30:52,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:30:52,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413387981]
[2024-05-12 12:30:52,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:30:52,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:30:52,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:30:52,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:30:52,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:30:52,570 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:30:52,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 497 transitions, 7862 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:52,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:30:52,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:30:52,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:30:55,808 INFO  L124   PetriNetUnfolderBase]: 6012/9573 cut-off events.
[2024-05-12 12:30:55,808 INFO  L125   PetriNetUnfolderBase]: For 345868/345868 co-relation queries the response was YES.
[2024-05-12 12:30:55,881 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73511 conditions, 9573 events. 6012/9573 cut-off events. For 345868/345868 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 61983 event pairs, 1515 based on Foata normal form. 20/9348 useless extension candidates. Maximal degree in co-relation 73388. Up to 7997 conditions per place. 
[2024-05-12 12:30:55,928 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 433 selfloop transitions, 106 changer transitions 0/548 dead transitions.
[2024-05-12 12:30:55,928 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 548 transitions, 9226 flow
[2024-05-12 12:30:55,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:30:55,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:30:55,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions.
[2024-05-12 12:30:55,929 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.53125
[2024-05-12 12:30:55,929 INFO  L175             Difference]: Start difference. First operand has 255 places, 497 transitions, 7862 flow. Second operand 8 states and 204 transitions.
[2024-05-12 12:30:55,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 548 transitions, 9226 flow
[2024-05-12 12:30:56,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 548 transitions, 8952 flow, removed 84 selfloop flow, removed 4 redundant places.
[2024-05-12 12:30:56,749 INFO  L231             Difference]: Finished difference. Result has 259 places, 498 transitions, 7855 flow
[2024-05-12 12:30:56,749 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7600, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7855, PETRI_PLACES=259, PETRI_TRANSITIONS=498}
[2024-05-12 12:30:56,749 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 205 predicate places.
[2024-05-12 12:30:56,749 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 498 transitions, 7855 flow
[2024-05-12 12:30:56,750 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:30:56,750 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:30:56,750 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:30:56,750 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-05-12 12:30:56,750 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:30:56,750 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:30:56,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -728801263, now seen corresponding path program 4 times
[2024-05-12 12:30:56,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:30:56,750 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367540875]
[2024-05-12 12:30:56,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:30:56,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:30:56,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:31:07,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:31:07,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:31:07,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367540875]
[2024-05-12 12:31:07,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367540875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:31:07,027 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:31:07,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:31:07,027 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601380722]
[2024-05-12 12:31:07,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:31:07,027 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:31:07,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:31:07,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:31:07,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:31:07,130 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:31:07,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 498 transitions, 7855 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:07,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:31:07,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:31:07,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:31:10,243 INFO  L124   PetriNetUnfolderBase]: 6202/9859 cut-off events.
[2024-05-12 12:31:10,243 INFO  L125   PetriNetUnfolderBase]: For 348326/348332 co-relation queries the response was YES.
[2024-05-12 12:31:10,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75275 conditions, 9859 events. 6202/9859 cut-off events. For 348326/348332 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 63901 event pairs, 1526 based on Foata normal form. 26/9642 useless extension candidates. Maximal degree in co-relation 75150. Up to 7954 conditions per place. 
[2024-05-12 12:31:10,353 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 386 selfloop transitions, 175 changer transitions 0/570 dead transitions.
[2024-05-12 12:31:10,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 570 transitions, 9407 flow
[2024-05-12 12:31:10,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:31:10,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:31:10,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions.
[2024-05-12 12:31:10,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5354166666666667
[2024-05-12 12:31:10,354 INFO  L175             Difference]: Start difference. First operand has 259 places, 498 transitions, 7855 flow. Second operand 10 states and 257 transitions.
[2024-05-12 12:31:10,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 570 transitions, 9407 flow
[2024-05-12 12:31:10,902 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 570 transitions, 9196 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-05-12 12:31:10,909 INFO  L231             Difference]: Finished difference. Result has 263 places, 500 transitions, 8088 flow
[2024-05-12 12:31:10,910 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7644, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8088, PETRI_PLACES=263, PETRI_TRANSITIONS=500}
[2024-05-12 12:31:10,910 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 209 predicate places.
[2024-05-12 12:31:10,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 500 transitions, 8088 flow
[2024-05-12 12:31:10,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:10,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:31:10,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:31:10,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-05-12 12:31:10,910 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:31:10,911 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:31:10,911 INFO  L85        PathProgramCache]: Analyzing trace with hash -928247203, now seen corresponding path program 5 times
[2024-05-12 12:31:10,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:31:10,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026473358]
[2024-05-12 12:31:10,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:31:10,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:31:10,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:31:21,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:31:21,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:31:21,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026473358]
[2024-05-12 12:31:21,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026473358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:31:21,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:31:21,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:31:21,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589939168]
[2024-05-12 12:31:21,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:31:21,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:31:21,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:31:21,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:31:21,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:31:21,312 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:31:21,312 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 500 transitions, 8088 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:21,312 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:31:21,312 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:31:21,312 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:31:24,508 INFO  L124   PetriNetUnfolderBase]: 6392/10147 cut-off events.
[2024-05-12 12:31:24,508 INFO  L125   PetriNetUnfolderBase]: For 382589/382595 co-relation queries the response was YES.
[2024-05-12 12:31:24,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79029 conditions, 10147 events. 6392/10147 cut-off events. For 382589/382595 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 66000 event pairs, 1602 based on Foata normal form. 26/9930 useless extension candidates. Maximal degree in co-relation 78903. Up to 8244 conditions per place. 
[2024-05-12 12:31:24,629 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 395 selfloop transitions, 169 changer transitions 0/573 dead transitions.
[2024-05-12 12:31:24,629 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 573 transitions, 9654 flow
[2024-05-12 12:31:24,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:31:24,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:31:24,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions.
[2024-05-12 12:31:24,632 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5395833333333333
[2024-05-12 12:31:24,632 INFO  L175             Difference]: Start difference. First operand has 263 places, 500 transitions, 8088 flow. Second operand 10 states and 259 transitions.
[2024-05-12 12:31:24,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 573 transitions, 9654 flow
[2024-05-12 12:31:25,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 573 transitions, 9264 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-05-12 12:31:25,357 INFO  L231             Difference]: Finished difference. Result has 265 places, 502 transitions, 8134 flow
[2024-05-12 12:31:25,357 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7698, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8134, PETRI_PLACES=265, PETRI_TRANSITIONS=502}
[2024-05-12 12:31:25,357 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 211 predicate places.
[2024-05-12 12:31:25,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 502 transitions, 8134 flow
[2024-05-12 12:31:25,358 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:25,358 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:31:25,358 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:31:25,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-05-12 12:31:25,358 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:31:25,358 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:31:25,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -928250923, now seen corresponding path program 6 times
[2024-05-12 12:31:25,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:31:25,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868552479]
[2024-05-12 12:31:25,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:31:25,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:31:25,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:31:35,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:31:35,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:31:35,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868552479]
[2024-05-12 12:31:35,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868552479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:31:35,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:31:35,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:31:35,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311295317]
[2024-05-12 12:31:35,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:31:35,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:31:35,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:31:35,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:31:35,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:31:35,918 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:31:35,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 502 transitions, 8134 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:35,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:31:35,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:31:35,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:31:39,188 INFO  L124   PetriNetUnfolderBase]: 6548/10387 cut-off events.
[2024-05-12 12:31:39,188 INFO  L125   PetriNetUnfolderBase]: For 395693/395699 co-relation queries the response was YES.
[2024-05-12 12:31:39,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80851 conditions, 10387 events. 6548/10387 cut-off events. For 395693/395699 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 67699 event pairs, 1573 based on Foata normal form. 22/10166 useless extension candidates. Maximal degree in co-relation 80724. Up to 8024 conditions per place. 
[2024-05-12 12:31:39,313 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 398 selfloop transitions, 174 changer transitions 0/581 dead transitions.
[2024-05-12 12:31:39,313 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 581 transitions, 9806 flow
[2024-05-12 12:31:39,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:31:39,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:31:39,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions.
[2024-05-12 12:31:39,314 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.54375
[2024-05-12 12:31:39,315 INFO  L175             Difference]: Start difference. First operand has 265 places, 502 transitions, 8134 flow. Second operand 10 states and 261 transitions.
[2024-05-12 12:31:39,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 581 transitions, 9806 flow
[2024-05-12 12:31:40,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 581 transitions, 9424 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-05-12 12:31:40,055 INFO  L231             Difference]: Finished difference. Result has 268 places, 507 transitions, 8280 flow
[2024-05-12 12:31:40,055 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7752, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8280, PETRI_PLACES=268, PETRI_TRANSITIONS=507}
[2024-05-12 12:31:40,055 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 214 predicate places.
[2024-05-12 12:31:40,055 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 507 transitions, 8280 flow
[2024-05-12 12:31:40,055 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:40,055 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:31:40,056 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:31:40,056 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-05-12 12:31:40,056 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:31:40,056 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:31:40,056 INFO  L85        PathProgramCache]: Analyzing trace with hash 2038907457, now seen corresponding path program 1 times
[2024-05-12 12:31:40,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:31:40,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388236989]
[2024-05-12 12:31:40,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:31:40,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:31:40,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:31:48,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:31:48,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:31:48,906 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388236989]
[2024-05-12 12:31:48,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388236989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:31:48,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:31:48,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 12:31:48,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640837064]
[2024-05-12 12:31:48,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:31:48,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 12:31:48,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:31:48,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 12:31:48,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-05-12 12:31:49,132 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:31:49,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 507 transitions, 8280 flow. Second operand  has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:49,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:31:49,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:31:49,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:31:52,551 INFO  L124   PetriNetUnfolderBase]: 6654/10572 cut-off events.
[2024-05-12 12:31:52,551 INFO  L125   PetriNetUnfolderBase]: For 405299/405305 co-relation queries the response was YES.
[2024-05-12 12:31:52,620 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82455 conditions, 10572 events. 6654/10572 cut-off events. For 405299/405305 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 69374 event pairs, 1584 based on Foata normal form. 18/10345 useless extension candidates. Maximal degree in co-relation 82326. Up to 7954 conditions per place. 
[2024-05-12 12:31:52,669 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 390 selfloop transitions, 182 changer transitions 0/581 dead transitions.
[2024-05-12 12:31:52,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 581 transitions, 9888 flow
[2024-05-12 12:31:52,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:31:52,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:31:52,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions.
[2024-05-12 12:31:52,670 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5375
[2024-05-12 12:31:52,670 INFO  L175             Difference]: Start difference. First operand has 268 places, 507 transitions, 8280 flow. Second operand 10 states and 258 transitions.
[2024-05-12 12:31:52,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 581 transitions, 9888 flow
[2024-05-12 12:31:53,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 581 transitions, 9601 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-05-12 12:31:53,536 INFO  L231             Difference]: Finished difference. Result has 272 places, 509 transitions, 8460 flow
[2024-05-12 12:31:53,536 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7993, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8460, PETRI_PLACES=272, PETRI_TRANSITIONS=509}
[2024-05-12 12:31:53,537 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 218 predicate places.
[2024-05-12 12:31:53,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 509 transitions, 8460 flow
[2024-05-12 12:31:53,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:31:53,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:31:53,537 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:31:53,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-05-12 12:31:53,537 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:31:53,537 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:31:53,537 INFO  L85        PathProgramCache]: Analyzing trace with hash -2054391639, now seen corresponding path program 1 times
[2024-05-12 12:31:53,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:31:53,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23056108]
[2024-05-12 12:31:53,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:31:53,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:31:53,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:32:00,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:32:00,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:32:00,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23056108]
[2024-05-12 12:32:00,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23056108] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:32:00,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:32:00,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:32:00,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562603466]
[2024-05-12 12:32:00,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:32:00,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:32:00,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:32:00,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:32:00,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:32:01,046 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:32:01,046 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 509 transitions, 8460 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:01,046 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:32:01,046 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:32:01,046 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:32:04,023 INFO  L124   PetriNetUnfolderBase]: 6674/10566 cut-off events.
[2024-05-12 12:32:04,023 INFO  L125   PetriNetUnfolderBase]: For 394066/394072 co-relation queries the response was YES.
[2024-05-12 12:32:04,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83026 conditions, 10566 events. 6674/10566 cut-off events. For 394066/394072 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 68934 event pairs, 1941 based on Foata normal form. 7/10341 useless extension candidates. Maximal degree in co-relation 82895. Up to 9557 conditions per place. 
[2024-05-12 12:32:04,152 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 504 selfloop transitions, 29 changer transitions 0/542 dead transitions.
[2024-05-12 12:32:04,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 542 transitions, 9759 flow
[2024-05-12 12:32:04,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:32:04,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:32:04,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-05-12 12:32:04,153 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-05-12 12:32:04,153 INFO  L175             Difference]: Start difference. First operand has 272 places, 509 transitions, 8460 flow. Second operand 7 states and 164 transitions.
[2024-05-12 12:32:04,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 542 transitions, 9759 flow
[2024-05-12 12:32:04,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 542 transitions, 9320 flow, removed 39 selfloop flow, removed 8 redundant places.
[2024-05-12 12:32:04,903 INFO  L231             Difference]: Finished difference. Result has 271 places, 513 transitions, 8163 flow
[2024-05-12 12:32:04,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8021, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8163, PETRI_PLACES=271, PETRI_TRANSITIONS=513}
[2024-05-12 12:32:04,903 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 217 predicate places.
[2024-05-12 12:32:04,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 513 transitions, 8163 flow
[2024-05-12 12:32:04,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:04,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:32:04,904 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:32:04,904 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-05-12 12:32:04,904 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:32:04,904 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:32:04,904 INFO  L85        PathProgramCache]: Analyzing trace with hash 1499194375, now seen corresponding path program 2 times
[2024-05-12 12:32:04,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:32:04,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026627683]
[2024-05-12 12:32:04,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:32:04,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:32:04,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:32:12,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:32:12,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:32:12,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026627683]
[2024-05-12 12:32:12,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026627683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:32:12,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:32:12,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:32:12,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158071203]
[2024-05-12 12:32:12,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:32:12,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:32:12,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:32:12,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:32:12,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:32:12,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:32:12,558 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 513 transitions, 8163 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:12,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:32:12,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:32:12,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:32:15,602 INFO  L124   PetriNetUnfolderBase]: 6717/10628 cut-off events.
[2024-05-12 12:32:15,603 INFO  L125   PetriNetUnfolderBase]: For 387790/387796 co-relation queries the response was YES.
[2024-05-12 12:32:15,678 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82086 conditions, 10628 events. 6717/10628 cut-off events. For 387790/387796 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 69349 event pairs, 1960 based on Foata normal form. 7/10404 useless extension candidates. Maximal degree in co-relation 81954. Up to 9577 conditions per place. 
[2024-05-12 12:32:15,722 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 505 selfloop transitions, 36 changer transitions 0/550 dead transitions.
[2024-05-12 12:32:15,722 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 550 transitions, 9694 flow
[2024-05-12 12:32:15,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:32:15,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:32:15,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions.
[2024-05-12 12:32:15,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-05-12 12:32:15,723 INFO  L175             Difference]: Start difference. First operand has 271 places, 513 transitions, 8163 flow. Second operand 7 states and 165 transitions.
[2024-05-12 12:32:15,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 550 transitions, 9694 flow
[2024-05-12 12:32:16,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 550 transitions, 9638 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-05-12 12:32:16,432 INFO  L231             Difference]: Finished difference. Result has 276 places, 520 transitions, 8360 flow
[2024-05-12 12:32:16,433 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8107, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8360, PETRI_PLACES=276, PETRI_TRANSITIONS=520}
[2024-05-12 12:32:16,433 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 222 predicate places.
[2024-05-12 12:32:16,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 276 places, 520 transitions, 8360 flow
[2024-05-12 12:32:16,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:16,433 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:32:16,433 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:32:16,433 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-05-12 12:32:16,433 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:32:16,433 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:32:16,434 INFO  L85        PathProgramCache]: Analyzing trace with hash 753262105, now seen corresponding path program 7 times
[2024-05-12 12:32:16,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:32:16,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798780761]
[2024-05-12 12:32:16,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:32:16,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:32:16,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:32:26,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:32:26,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:32:26,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798780761]
[2024-05-12 12:32:26,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798780761] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:32:26,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:32:26,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:32:26,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948031980]
[2024-05-12 12:32:26,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:32:26,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:32:26,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:32:26,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:32:26,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:32:26,792 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:32:26,792 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 520 transitions, 8360 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:26,792 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:32:26,792 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:32:26,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:32:30,206 INFO  L124   PetriNetUnfolderBase]: 6907/10977 cut-off events.
[2024-05-12 12:32:30,207 INFO  L125   PetriNetUnfolderBase]: For 437424/437424 co-relation queries the response was YES.
[2024-05-12 12:32:30,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85637 conditions, 10977 events. 6907/10977 cut-off events. For 437424/437424 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 72382 event pairs, 1672 based on Foata normal form. 20/10744 useless extension candidates. Maximal degree in co-relation 85503. Up to 9025 conditions per place. 
[2024-05-12 12:32:30,338 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 418 selfloop transitions, 170 changer transitions 0/597 dead transitions.
[2024-05-12 12:32:30,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 597 transitions, 9992 flow
[2024-05-12 12:32:30,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:32:30,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:32:30,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 282 transitions.
[2024-05-12 12:32:30,339 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5340909090909091
[2024-05-12 12:32:30,339 INFO  L175             Difference]: Start difference. First operand has 276 places, 520 transitions, 8360 flow. Second operand 11 states and 282 transitions.
[2024-05-12 12:32:30,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 597 transitions, 9992 flow
[2024-05-12 12:32:31,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 597 transitions, 9916 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-05-12 12:32:31,201 INFO  L231             Difference]: Finished difference. Result has 283 places, 522 transitions, 8734 flow
[2024-05-12 12:32:31,201 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8284, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8734, PETRI_PLACES=283, PETRI_TRANSITIONS=522}
[2024-05-12 12:32:31,201 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 229 predicate places.
[2024-05-12 12:32:31,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 522 transitions, 8734 flow
[2024-05-12 12:32:31,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:31,202 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:32:31,202 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:32:31,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-05-12 12:32:31,202 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:32:31,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:32:31,202 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420149841, now seen corresponding path program 8 times
[2024-05-12 12:32:31,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:32:31,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663090687]
[2024-05-12 12:32:31,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:32:31,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:32:31,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:32:41,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:32:41,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:32:41,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663090687]
[2024-05-12 12:32:41,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663090687] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:32:41,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:32:41,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:32:41,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322035388]
[2024-05-12 12:32:41,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:32:41,376 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:32:41,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:32:41,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:32:41,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:32:41,480 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:32:41,480 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 522 transitions, 8734 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:41,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:32:41,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:32:41,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:32:45,122 INFO  L124   PetriNetUnfolderBase]: 7097/11318 cut-off events.
[2024-05-12 12:32:45,122 INFO  L125   PetriNetUnfolderBase]: For 484366/484366 co-relation queries the response was YES.
[2024-05-12 12:32:45,211 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90056 conditions, 11318 events. 7097/11318 cut-off events. For 484366/484366 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 75322 event pairs, 1720 based on Foata normal form. 20/11073 useless extension candidates. Maximal degree in co-relation 89921. Up to 9315 conditions per place. 
[2024-05-12 12:32:45,263 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 406 selfloop transitions, 183 changer transitions 0/598 dead transitions.
[2024-05-12 12:32:45,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 598 transitions, 10368 flow
[2024-05-12 12:32:45,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:32:45,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:32:45,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions.
[2024-05-12 12:32:45,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5265151515151515
[2024-05-12 12:32:45,264 INFO  L175             Difference]: Start difference. First operand has 283 places, 522 transitions, 8734 flow. Second operand 11 states and 278 transitions.
[2024-05-12 12:32:45,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 598 transitions, 10368 flow
[2024-05-12 12:32:46,293 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 598 transitions, 10013 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-05-12 12:32:46,300 INFO  L231             Difference]: Finished difference. Result has 287 places, 524 transitions, 8859 flow
[2024-05-12 12:32:46,300 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8379, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8859, PETRI_PLACES=287, PETRI_TRANSITIONS=524}
[2024-05-12 12:32:46,300 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 233 predicate places.
[2024-05-12 12:32:46,301 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 524 transitions, 8859 flow
[2024-05-12 12:32:46,301 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:46,301 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:32:46,301 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:32:46,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-05-12 12:32:46,301 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:32:46,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:32:46,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 991661427, now seen corresponding path program 9 times
[2024-05-12 12:32:46,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:32:46,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113716091]
[2024-05-12 12:32:46,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:32:46,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:32:46,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:32:56,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-05-12 12:32:56,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:32:56,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113716091]
[2024-05-12 12:32:56,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113716091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:32:56,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:32:56,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:32:56,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221834021]
[2024-05-12 12:32:56,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:32:56,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:32:56,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:32:56,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:32:56,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:32:56,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:32:56,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 524 transitions, 8859 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:32:56,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:32:56,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:32:56,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:33:00,129 INFO  L124   PetriNetUnfolderBase]: 7287/11632 cut-off events.
[2024-05-12 12:33:00,129 INFO  L125   PetriNetUnfolderBase]: For 509271/509271 co-relation queries the response was YES.
[2024-05-12 12:33:00,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92719 conditions, 11632 events. 7287/11632 cut-off events. For 509271/509271 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 77740 event pairs, 1770 based on Foata normal form. 20/11379 useless extension candidates. Maximal degree in co-relation 92583. Up to 9605 conditions per place. 
[2024-05-12 12:33:00,282 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 420 selfloop transitions, 172 changer transitions 0/601 dead transitions.
[2024-05-12 12:33:00,282 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 601 transitions, 10507 flow
[2024-05-12 12:33:00,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:33:00,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:33:00,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 281 transitions.
[2024-05-12 12:33:00,283 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5321969696969697
[2024-05-12 12:33:00,283 INFO  L175             Difference]: Start difference. First operand has 287 places, 524 transitions, 8859 flow. Second operand 11 states and 281 transitions.
[2024-05-12 12:33:00,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 601 transitions, 10507 flow
[2024-05-12 12:33:01,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 601 transitions, 10152 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-05-12 12:33:01,484 INFO  L231             Difference]: Finished difference. Result has 291 places, 526 transitions, 8966 flow
[2024-05-12 12:33:01,485 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8504, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8966, PETRI_PLACES=291, PETRI_TRANSITIONS=526}
[2024-05-12 12:33:01,485 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 237 predicate places.
[2024-05-12 12:33:01,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 526 transitions, 8966 flow
[2024-05-12 12:33:01,485 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:01,485 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:33:01,485 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:33:01,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-05-12 12:33:01,485 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:33:01,486 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:33:01,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 991513557, now seen corresponding path program 10 times
[2024-05-12 12:33:01,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:33:01,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730778988]
[2024-05-12 12:33:01,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:33:01,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:33:01,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:33:11,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:33:11,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:33:11,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730778988]
[2024-05-12 12:33:11,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730778988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:33:11,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:33:11,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:33:11,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793786330]
[2024-05-12 12:33:11,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:33:11,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:33:11,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:33:11,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:33:11,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:33:12,104 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:33:12,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 526 transitions, 8966 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:12,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:33:12,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:33:12,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:33:15,755 INFO  L124   PetriNetUnfolderBase]: 7359/11680 cut-off events.
[2024-05-12 12:33:15,755 INFO  L125   PetriNetUnfolderBase]: For 504472/504472 co-relation queries the response was YES.
[2024-05-12 12:33:15,848 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92789 conditions, 11680 events. 7359/11680 cut-off events. For 504472/504472 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 77621 event pairs, 1715 based on Foata normal form. 16/11443 useless extension candidates. Maximal degree in co-relation 92652. Up to 9021 conditions per place. 
[2024-05-12 12:33:15,899 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 421 selfloop transitions, 179 changer transitions 0/609 dead transitions.
[2024-05-12 12:33:15,900 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 609 transitions, 10730 flow
[2024-05-12 12:33:15,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:33:15,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:33:15,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 283 transitions.
[2024-05-12 12:33:15,900 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5359848484848485
[2024-05-12 12:33:15,900 INFO  L175             Difference]: Start difference. First operand has 291 places, 526 transitions, 8966 flow. Second operand 11 states and 283 transitions.
[2024-05-12 12:33:15,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 609 transitions, 10730 flow
[2024-05-12 12:33:16,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 609 transitions, 10322 flow, removed 35 selfloop flow, removed 9 redundant places.
[2024-05-12 12:33:16,937 INFO  L231             Difference]: Finished difference. Result has 294 places, 531 transitions, 9132 flow
[2024-05-12 12:33:16,937 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8558, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9132, PETRI_PLACES=294, PETRI_TRANSITIONS=531}
[2024-05-12 12:33:16,938 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 240 predicate places.
[2024-05-12 12:33:16,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 294 places, 531 transitions, 9132 flow
[2024-05-12 12:33:16,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:16,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:33:16,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:33:16,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-05-12 12:33:16,938 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:33:16,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:33:16,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -1412525329, now seen corresponding path program 2 times
[2024-05-12 12:33:16,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:33:16,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150808599]
[2024-05-12 12:33:16,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:33:16,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:33:16,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:33:25,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:33:25,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:33:25,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150808599]
[2024-05-12 12:33:25,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150808599] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:33:25,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:33:25,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 12:33:25,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890261605]
[2024-05-12 12:33:25,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:33:25,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 12:33:25,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:33:25,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 12:33:25,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-05-12 12:33:25,902 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:33:25,903 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 531 transitions, 9132 flow. Second operand  has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:25,903 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:33:25,903 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:33:25,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:33:29,896 INFO  L124   PetriNetUnfolderBase]: 7465/11963 cut-off events.
[2024-05-12 12:33:29,896 INFO  L125   PetriNetUnfolderBase]: For 512723/512723 co-relation queries the response was YES.
[2024-05-12 12:33:29,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94457 conditions, 11963 events. 7465/11963 cut-off events. For 512723/512723 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 80879 event pairs, 1804 based on Foata normal form. 12/11692 useless extension candidates. Maximal degree in co-relation 94318. Up to 9713 conditions per place. 
[2024-05-12 12:33:30,028 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 414 selfloop transitions, 186 changer transitions 0/609 dead transitions.
[2024-05-12 12:33:30,028 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 609 transitions, 10822 flow
[2024-05-12 12:33:30,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:33:30,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:33:30,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 280 transitions.
[2024-05-12 12:33:30,037 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2024-05-12 12:33:30,037 INFO  L175             Difference]: Start difference. First operand has 294 places, 531 transitions, 9132 flow. Second operand 11 states and 280 transitions.
[2024-05-12 12:33:30,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 609 transitions, 10822 flow
[2024-05-12 12:33:31,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 609 transitions, 10501 flow, removed 59 selfloop flow, removed 7 redundant places.
[2024-05-12 12:33:31,130 INFO  L231             Difference]: Finished difference. Result has 298 places, 533 transitions, 9306 flow
[2024-05-12 12:33:31,130 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8811, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9306, PETRI_PLACES=298, PETRI_TRANSITIONS=533}
[2024-05-12 12:33:31,130 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 244 predicate places.
[2024-05-12 12:33:31,130 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 533 transitions, 9306 flow
[2024-05-12 12:33:31,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:31,131 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:33:31,131 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:33:31,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-05-12 12:33:31,131 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:33:31,131 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:33:31,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -850664721, now seen corresponding path program 3 times
[2024-05-12 12:33:31,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:33:31,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835959278]
[2024-05-12 12:33:31,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:33:31,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:33:31,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:33:40,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:33:40,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:33:40,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835959278]
[2024-05-12 12:33:40,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835959278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:33:40,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:33:40,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:33:40,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917576269]
[2024-05-12 12:33:40,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:33:40,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:33:40,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:33:40,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:33:40,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:33:41,091 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:33:41,091 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 533 transitions, 9306 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:41,091 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:33:41,091 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:33:41,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:33:44,989 INFO  L124   PetriNetUnfolderBase]: 7591/12097 cut-off events.
[2024-05-12 12:33:44,989 INFO  L125   PetriNetUnfolderBase]: For 528229/528229 co-relation queries the response was YES.
[2024-05-12 12:33:45,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96717 conditions, 12097 events. 7591/12097 cut-off events. For 528229/528229 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 81338 event pairs, 1642 based on Foata normal form. 12/11852 useless extension candidates. Maximal degree in co-relation 96576. Up to 8075 conditions per place. 
[2024-05-12 12:33:45,138 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 395 selfloop transitions, 210 changer transitions 0/614 dead transitions.
[2024-05-12 12:33:45,139 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 614 transitions, 11236 flow
[2024-05-12 12:33:45,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:33:45,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:33:45,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 280 transitions.
[2024-05-12 12:33:45,139 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2024-05-12 12:33:45,140 INFO  L175             Difference]: Start difference. First operand has 298 places, 533 transitions, 9306 flow. Second operand 11 states and 280 transitions.
[2024-05-12 12:33:45,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 614 transitions, 11236 flow
[2024-05-12 12:33:46,210 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 614 transitions, 10769 flow, removed 49 selfloop flow, removed 9 redundant places.
[2024-05-12 12:33:46,218 INFO  L231             Difference]: Finished difference. Result has 300 places, 537 transitions, 9502 flow
[2024-05-12 12:33:46,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8839, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9502, PETRI_PLACES=300, PETRI_TRANSITIONS=537}
[2024-05-12 12:33:46,218 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 246 predicate places.
[2024-05-12 12:33:46,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 300 places, 537 transitions, 9502 flow
[2024-05-12 12:33:46,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:46,219 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:33:46,219 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:33:46,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-05-12 12:33:46,219 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:33:46,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:33:46,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 1198587729, now seen corresponding path program 4 times
[2024-05-12 12:33:46,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:33:46,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311791268]
[2024-05-12 12:33:46,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:33:46,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:33:46,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:33:55,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:33:55,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:33:55,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311791268]
[2024-05-12 12:33:55,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311791268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:33:55,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:33:55,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 12:33:55,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142419500]
[2024-05-12 12:33:55,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:33:55,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 12:33:55,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:33:55,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 12:33:55,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-05-12 12:33:55,508 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:33:55,508 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 537 transitions, 9502 flow. Second operand  has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:33:55,508 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:33:55,508 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:33:55,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:33:59,569 INFO  L124   PetriNetUnfolderBase]: 7571/12129 cut-off events.
[2024-05-12 12:33:59,570 INFO  L125   PetriNetUnfolderBase]: For 517243/517243 co-relation queries the response was YES.
[2024-05-12 12:33:59,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95838 conditions, 12129 events. 7571/12129 cut-off events. For 517243/517243 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 82134 event pairs, 1836 based on Foata normal form. 12/11864 useless extension candidates. Maximal degree in co-relation 95696. Up to 9639 conditions per place. 
[2024-05-12 12:33:59,709 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 429 selfloop transitions, 175 changer transitions 0/613 dead transitions.
[2024-05-12 12:33:59,709 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 613 transitions, 11010 flow
[2024-05-12 12:33:59,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 12:33:59,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 12:33:59,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 282 transitions.
[2024-05-12 12:33:59,710 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5340909090909091
[2024-05-12 12:33:59,710 INFO  L175             Difference]: Start difference. First operand has 300 places, 537 transitions, 9502 flow. Second operand 11 states and 282 transitions.
[2024-05-12 12:33:59,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 613 transitions, 11010 flow
[2024-05-12 12:34:00,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 613 transitions, 10664 flow, removed 61 selfloop flow, removed 7 redundant places.
[2024-05-12 12:34:00,972 INFO  L231             Difference]: Finished difference. Result has 303 places, 536 transitions, 9429 flow
[2024-05-12 12:34:00,972 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9074, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9429, PETRI_PLACES=303, PETRI_TRANSITIONS=536}
[2024-05-12 12:34:00,973 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 249 predicate places.
[2024-05-12 12:34:00,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 303 places, 536 transitions, 9429 flow
[2024-05-12 12:34:00,973 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:00,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:34:00,973 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:34:00,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-05-12 12:34:00,973 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:34:00,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:34:00,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -1520511617, now seen corresponding path program 3 times
[2024-05-12 12:34:00,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:34:00,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575362687]
[2024-05-12 12:34:00,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:34:00,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:34:01,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:34:07,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:34:07,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:34:07,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575362687]
[2024-05-12 12:34:07,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575362687] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:34:07,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:34:07,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:34:07,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337634587]
[2024-05-12 12:34:07,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:34:07,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:34:07,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:34:07,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:34:07,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:34:07,989 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:34:07,989 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 536 transitions, 9429 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:07,989 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:34:07,989 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:34:07,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:34:11,414 INFO  L124   PetriNetUnfolderBase]: 7568/11997 cut-off events.
[2024-05-12 12:34:11,414 INFO  L125   PetriNetUnfolderBase]: For 484532/484532 co-relation queries the response was YES.
[2024-05-12 12:34:11,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95080 conditions, 11997 events. 7568/11997 cut-off events. For 484532/484532 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 80046 event pairs, 2252 based on Foata normal form. 1/11760 useless extension candidates. Maximal degree in co-relation 94936. Up to 10933 conditions per place. 
[2024-05-12 12:34:11,572 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 525 selfloop transitions, 29 changer transitions 0/563 dead transitions.
[2024-05-12 12:34:11,573 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 563 transitions, 10705 flow
[2024-05-12 12:34:11,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:34:11,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:34:11,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions.
[2024-05-12 12:34:11,573 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-05-12 12:34:11,573 INFO  L175             Difference]: Start difference. First operand has 303 places, 536 transitions, 9429 flow. Second operand 7 states and 160 transitions.
[2024-05-12 12:34:11,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 563 transitions, 10705 flow
[2024-05-12 12:34:12,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 563 transitions, 10209 flow, removed 42 selfloop flow, removed 10 redundant places.
[2024-05-12 12:34:12,763 INFO  L231             Difference]: Finished difference. Result has 300 places, 536 transitions, 8997 flow
[2024-05-12 12:34:12,763 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8933, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8997, PETRI_PLACES=300, PETRI_TRANSITIONS=536}
[2024-05-12 12:34:12,763 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 246 predicate places.
[2024-05-12 12:34:12,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 300 places, 536 transitions, 8997 flow
[2024-05-12 12:34:12,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:12,763 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:34:12,763 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:34:12,764 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-05-12 12:34:12,764 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:34:12,764 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:34:12,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -677817337, now seen corresponding path program 4 times
[2024-05-12 12:34:12,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:34:12,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637027001]
[2024-05-12 12:34:12,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:34:12,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:34:12,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:34:19,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:34:19,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:34:19,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637027001]
[2024-05-12 12:34:19,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637027001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:34:19,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:34:19,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:34:19,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005550243]
[2024-05-12 12:34:19,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:34:19,762 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:34:19,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:34:19,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:34:19,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:34:19,858 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:34:19,859 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 536 transitions, 8997 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:19,859 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:34:19,859 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:34:19,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:34:23,221 INFO  L124   PetriNetUnfolderBase]: 7560/11989 cut-off events.
[2024-05-12 12:34:23,221 INFO  L125   PetriNetUnfolderBase]: For 469771/469771 co-relation queries the response was YES.
[2024-05-12 12:34:23,330 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93103 conditions, 11989 events. 7560/11989 cut-off events. For 469771/469771 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 80036 event pairs, 2241 based on Foata normal form. 2/11754 useless extension candidates. Maximal degree in co-relation 92958. Up to 10832 conditions per place. 
[2024-05-12 12:34:23,384 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 514 selfloop transitions, 41 changer transitions 0/564 dead transitions.
[2024-05-12 12:34:23,384 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 564 transitions, 10353 flow
[2024-05-12 12:34:23,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:34:23,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:34:23,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions.
[2024-05-12 12:34:23,385 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-05-12 12:34:23,385 INFO  L175             Difference]: Start difference. First operand has 300 places, 536 transitions, 8997 flow. Second operand 7 states and 162 transitions.
[2024-05-12 12:34:23,385 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 564 transitions, 10353 flow
[2024-05-12 12:34:24,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 564 transitions, 10267 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-05-12 12:34:24,802 INFO  L231             Difference]: Finished difference. Result has 302 places, 536 transitions, 9002 flow
[2024-05-12 12:34:24,802 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8911, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9002, PETRI_PLACES=302, PETRI_TRANSITIONS=536}
[2024-05-12 12:34:24,802 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 248 predicate places.
[2024-05-12 12:34:24,802 INFO  L495      AbstractCegarLoop]: Abstraction has has 302 places, 536 transitions, 9002 flow
[2024-05-12 12:34:24,802 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:24,802 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:34:24,802 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:34:24,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-05-12 12:34:24,803 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:34:24,803 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:34:24,803 INFO  L85        PathProgramCache]: Analyzing trace with hash 540225607, now seen corresponding path program 5 times
[2024-05-12 12:34:24,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:34:24,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528598617]
[2024-05-12 12:34:24,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:34:24,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:34:24,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:34:32,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:34:32,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:34:32,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528598617]
[2024-05-12 12:34:32,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528598617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:34:32,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:34:32,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:34:32,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597854492]
[2024-05-12 12:34:32,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:34:32,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:34:32,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:34:32,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:34:32,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:34:32,250 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:34:32,250 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 536 transitions, 9002 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:32,250 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:34:32,250 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:34:32,250 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:34:35,636 INFO  L124   PetriNetUnfolderBase]: 7600/12054 cut-off events.
[2024-05-12 12:34:35,636 INFO  L125   PetriNetUnfolderBase]: For 484824/484830 co-relation queries the response was YES.
[2024-05-12 12:34:35,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93830 conditions, 12054 events. 7600/12054 cut-off events. For 484824/484830 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 80511 event pairs, 2228 based on Foata normal form. 8/11827 useless extension candidates. Maximal degree in co-relation 93684. Up to 10649 conditions per place. 
[2024-05-12 12:34:35,795 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 492 selfloop transitions, 70 changer transitions 0/571 dead transitions.
[2024-05-12 12:34:35,796 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 571 transitions, 10646 flow
[2024-05-12 12:34:35,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:34:35,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:34:35,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions.
[2024-05-12 12:34:35,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-05-12 12:34:35,796 INFO  L175             Difference]: Start difference. First operand has 302 places, 536 transitions, 9002 flow. Second operand 7 states and 165 transitions.
[2024-05-12 12:34:35,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 571 transitions, 10646 flow
[2024-05-12 12:34:36,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 571 transitions, 10534 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-05-12 12:34:36,917 INFO  L231             Difference]: Finished difference. Result has 303 places, 540 transitions, 9109 flow
[2024-05-12 12:34:36,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8890, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9109, PETRI_PLACES=303, PETRI_TRANSITIONS=540}
[2024-05-12 12:34:36,917 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 249 predicate places.
[2024-05-12 12:34:36,917 INFO  L495      AbstractCegarLoop]: Abstraction has has 303 places, 540 transitions, 9109 flow
[2024-05-12 12:34:36,917 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:36,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:34:36,918 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:34:36,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-05-12 12:34:36,918 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:34:36,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:34:36,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 1570517657, now seen corresponding path program 6 times
[2024-05-12 12:34:36,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:34:36,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641295649]
[2024-05-12 12:34:36,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:34:36,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:34:36,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:34:44,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:34:44,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:34:44,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641295649]
[2024-05-12 12:34:44,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641295649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:34:44,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:34:44,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:34:44,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599428492]
[2024-05-12 12:34:44,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:34:44,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:34:44,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:34:44,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:34:44,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:34:44,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:34:44,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 540 transitions, 9109 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:44,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:34:44,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:34:44,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:34:48,230 INFO  L124   PetriNetUnfolderBase]: 7592/12038 cut-off events.
[2024-05-12 12:34:48,230 INFO  L125   PetriNetUnfolderBase]: For 489370/489376 co-relation queries the response was YES.
[2024-05-12 12:34:48,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93944 conditions, 12038 events. 7592/12038 cut-off events. For 489370/489376 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 80297 event pairs, 2233 based on Foata normal form. 8/11813 useless extension candidates. Maximal degree in co-relation 93797. Up to 10641 conditions per place. 
[2024-05-12 12:34:48,371 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 496 selfloop transitions, 65 changer transitions 0/570 dead transitions.
[2024-05-12 12:34:48,371 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 570 transitions, 10559 flow
[2024-05-12 12:34:48,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:34:48,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:34:48,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-05-12 12:34:48,372 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-05-12 12:34:48,372 INFO  L175             Difference]: Start difference. First operand has 303 places, 540 transitions, 9109 flow. Second operand 7 states and 164 transitions.
[2024-05-12 12:34:48,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 570 transitions, 10559 flow
[2024-05-12 12:34:49,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 570 transitions, 10331 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-05-12 12:34:49,441 INFO  L231             Difference]: Finished difference. Result has 304 places, 540 transitions, 9021 flow
[2024-05-12 12:34:49,441 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8881, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9021, PETRI_PLACES=304, PETRI_TRANSITIONS=540}
[2024-05-12 12:34:49,442 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 250 predicate places.
[2024-05-12 12:34:49,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 540 transitions, 9021 flow
[2024-05-12 12:34:49,442 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:49,442 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:34:49,442 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:34:49,442 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-05-12 12:34:49,442 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:34:49,442 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:34:49,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139486489, now seen corresponding path program 1 times
[2024-05-12 12:34:49,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:34:49,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440515886]
[2024-05-12 12:34:49,442 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:34:49,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:34:49,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:34:57,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:34:57,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:34:57,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440515886]
[2024-05-12 12:34:57,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440515886] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:34:57,645 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:34:57,645 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:34:57,645 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717120862]
[2024-05-12 12:34:57,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:34:57,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:34:57,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:34:57,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:34:57,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:34:57,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:34:57,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 540 transitions, 9021 flow. Second operand  has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:34:57,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:34:57,753 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:34:57,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:35:01,072 INFO  L124   PetriNetUnfolderBase]: 7245/11628 cut-off events.
[2024-05-12 12:35:01,072 INFO  L125   PetriNetUnfolderBase]: For 491759/491855 co-relation queries the response was YES.
[2024-05-12 12:35:01,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90818 conditions, 11628 events. 7245/11628 cut-off events. For 491759/491855 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 78570 event pairs, 2085 based on Foata normal form. 31/11266 useless extension candidates. Maximal degree in co-relation 90671. Up to 10066 conditions per place. 
[2024-05-12 12:35:01,242 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 475 selfloop transitions, 48 changer transitions 0/575 dead transitions.
[2024-05-12 12:35:01,242 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 575 transitions, 10576 flow
[2024-05-12 12:35:01,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:35:01,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:35:01,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions.
[2024-05-12 12:35:01,243 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49702380952380953
[2024-05-12 12:35:01,243 INFO  L175             Difference]: Start difference. First operand has 304 places, 540 transitions, 9021 flow. Second operand 7 states and 167 transitions.
[2024-05-12 12:35:01,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 575 transitions, 10576 flow
[2024-05-12 12:35:02,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 575 transitions, 10430 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-05-12 12:35:02,722 INFO  L231             Difference]: Finished difference. Result has 306 places, 548 transitions, 9197 flow
[2024-05-12 12:35:02,722 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8875, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9197, PETRI_PLACES=306, PETRI_TRANSITIONS=548}
[2024-05-12 12:35:02,723 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 252 predicate places.
[2024-05-12 12:35:02,723 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 548 transitions, 9197 flow
[2024-05-12 12:35:02,723 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:02,723 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:35:02,723 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:35:02,723 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-05-12 12:35:02,723 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:35:02,723 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:35:02,723 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139991479, now seen corresponding path program 2 times
[2024-05-12 12:35:02,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:35:02,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676439946]
[2024-05-12 12:35:02,724 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:35:02,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:35:02,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:35:10,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:35:10,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:35:10,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676439946]
[2024-05-12 12:35:10,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676439946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:35:10,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:35:10,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 12:35:10,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421197290]
[2024-05-12 12:35:10,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:35:10,737 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 12:35:10,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:35:10,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 12:35:10,738 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 12:35:10,820 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 12:35:10,820 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 548 transitions, 9197 flow. Second operand  has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:10,820 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:35:10,820 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 12:35:10,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:35:14,117 INFO  L124   PetriNetUnfolderBase]: 7217/11620 cut-off events.
[2024-05-12 12:35:14,117 INFO  L125   PetriNetUnfolderBase]: For 505790/505864 co-relation queries the response was YES.
[2024-05-12 12:35:14,224 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91714 conditions, 11620 events. 7217/11620 cut-off events. For 505790/505864 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 78806 event pairs, 2089 based on Foata normal form. 31/11268 useless extension candidates. Maximal degree in co-relation 91565. Up to 10080 conditions per place. 
[2024-05-12 12:35:14,277 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 479 selfloop transitions, 44 changer transitions 0/575 dead transitions.
[2024-05-12 12:35:14,277 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 575 transitions, 10494 flow
[2024-05-12 12:35:14,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 12:35:14,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 12:35:14,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-05-12 12:35:14,278 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-05-12 12:35:14,278 INFO  L175             Difference]: Start difference. First operand has 306 places, 548 transitions, 9197 flow. Second operand 7 states and 166 transitions.
[2024-05-12 12:35:14,278 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 575 transitions, 10494 flow
[2024-05-12 12:35:15,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 575 transitions, 10304 flow, removed 74 selfloop flow, removed 3 redundant places.
[2024-05-12 12:35:15,786 INFO  L231             Difference]: Finished difference. Result has 310 places, 548 transitions, 9103 flow
[2024-05-12 12:35:15,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9007, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9103, PETRI_PLACES=310, PETRI_TRANSITIONS=548}
[2024-05-12 12:35:15,787 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 256 predicate places.
[2024-05-12 12:35:15,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 310 places, 548 transitions, 9103 flow
[2024-05-12 12:35:15,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:15,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:35:15,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:35:15,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-05-12 12:35:15,787 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:35:15,787 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:35:15,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 1918831147, now seen corresponding path program 1 times
[2024-05-12 12:35:15,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:35:15,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453838333]
[2024-05-12 12:35:15,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:35:15,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:35:15,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:35:23,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:35:23,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:35:23,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453838333]
[2024-05-12 12:35:23,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453838333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:35:23,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:35:23,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:35:23,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365202573]
[2024-05-12 12:35:23,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:35:23,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:35:23,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:35:23,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:35:23,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:35:23,530 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:35:23,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 548 transitions, 9103 flow. Second operand  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:23,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:35:23,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:35:23,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:35:27,142 INFO  L124   PetriNetUnfolderBase]: 7645/12149 cut-off events.
[2024-05-12 12:35:27,142 INFO  L125   PetriNetUnfolderBase]: For 513585/513585 co-relation queries the response was YES.
[2024-05-12 12:35:27,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95537 conditions, 12149 events. 7645/12149 cut-off events. For 513585/513585 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 81485 event pairs, 2296 based on Foata normal form. 1/11911 useless extension candidates. Maximal degree in co-relation 95386. Up to 11051 conditions per place. 
[2024-05-12 12:35:27,297 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 536 selfloop transitions, 39 changer transitions 0/584 dead transitions.
[2024-05-12 12:35:27,297 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 584 transitions, 10555 flow
[2024-05-12 12:35:27,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 12:35:27,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 12:35:27,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-05-12 12:35:27,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44907407407407407
[2024-05-12 12:35:27,298 INFO  L175             Difference]: Start difference. First operand has 310 places, 548 transitions, 9103 flow. Second operand 9 states and 194 transitions.
[2024-05-12 12:35:27,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 584 transitions, 10555 flow
[2024-05-12 12:35:28,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 584 transitions, 10318 flow, removed 71 selfloop flow, removed 6 redundant places.
[2024-05-12 12:35:28,985 INFO  L231             Difference]: Finished difference. Result has 314 places, 557 transitions, 9159 flow
[2024-05-12 12:35:28,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8906, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9159, PETRI_PLACES=314, PETRI_TRANSITIONS=557}
[2024-05-12 12:35:28,985 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 260 predicate places.
[2024-05-12 12:35:28,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 557 transitions, 9159 flow
[2024-05-12 12:35:28,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:28,986 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:35:28,986 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:35:28,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-05-12 12:35:28,986 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:35:28,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:35:28,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -681556123, now seen corresponding path program 1 times
[2024-05-12 12:35:28,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:35:28,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654238870]
[2024-05-12 12:35:28,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:35:28,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:35:29,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:35:36,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:35:36,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:35:36,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654238870]
[2024-05-12 12:35:36,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654238870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:35:36,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:35:36,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:35:36,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439194284]
[2024-05-12 12:35:36,083 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:35:36,083 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:35:36,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:35:36,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:35:36,084 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:35:36,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:35:36,205 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 557 transitions, 9159 flow. Second operand  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:36,205 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:35:36,205 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:35:36,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:35:39,807 INFO  L124   PetriNetUnfolderBase]: 7790/12321 cut-off events.
[2024-05-12 12:35:39,807 INFO  L125   PetriNetUnfolderBase]: For 543097/543097 co-relation queries the response was YES.
[2024-05-12 12:35:39,928 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97662 conditions, 12321 events. 7790/12321 cut-off events. For 543097/543097 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 82296 event pairs, 2170 based on Foata normal form. 4/12083 useless extension candidates. Maximal degree in co-relation 97509. Up to 10953 conditions per place. 
[2024-05-12 12:35:39,986 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 515 selfloop transitions, 94 changer transitions 0/618 dead transitions.
[2024-05-12 12:35:39,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 618 transitions, 11145 flow
[2024-05-12 12:35:39,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:35:39,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:35:39,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions.
[2024-05-12 12:35:39,987 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-05-12 12:35:39,987 INFO  L175             Difference]: Start difference. First operand has 314 places, 557 transitions, 9159 flow. Second operand 10 states and 230 transitions.
[2024-05-12 12:35:39,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 618 transitions, 11145 flow
[2024-05-12 12:35:41,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 618 transitions, 11070 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-05-12 12:35:41,616 INFO  L231             Difference]: Finished difference. Result has 321 places, 578 transitions, 9783 flow
[2024-05-12 12:35:41,616 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9084, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9783, PETRI_PLACES=321, PETRI_TRANSITIONS=578}
[2024-05-12 12:35:41,616 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 267 predicate places.
[2024-05-12 12:35:41,616 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 578 transitions, 9783 flow
[2024-05-12 12:35:41,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:41,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:35:41,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:35:41,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-05-12 12:35:41,617 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:35:41,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:35:41,617 INFO  L85        PathProgramCache]: Analyzing trace with hash -1828910099, now seen corresponding path program 1 times
[2024-05-12 12:35:41,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:35:41,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049026575]
[2024-05-12 12:35:41,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:35:41,617 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:35:41,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:35:49,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:35:49,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:35:49,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049026575]
[2024-05-12 12:35:49,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049026575] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:35:49,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:35:49,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:35:49,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871526492]
[2024-05-12 12:35:49,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:35:49,605 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:35:49,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:35:49,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:35:49,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:35:49,694 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:35:49,708 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 578 transitions, 9783 flow. Second operand  has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:49,708 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:35:49,708 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:35:49,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:35:53,464 INFO  L124   PetriNetUnfolderBase]: 7830/12380 cut-off events.
[2024-05-12 12:35:53,464 INFO  L125   PetriNetUnfolderBase]: For 569293/569293 co-relation queries the response was YES.
[2024-05-12 12:35:53,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101304 conditions, 12380 events. 7830/12380 cut-off events. For 569293/569293 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 82679 event pairs, 2173 based on Foata normal form. 2/12140 useless extension candidates. Maximal degree in co-relation 101148. Up to 11171 conditions per place. 
[2024-05-12 12:35:53,637 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 559 selfloop transitions, 48 changer transitions 0/616 dead transitions.
[2024-05-12 12:35:53,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 616 transitions, 11429 flow
[2024-05-12 12:35:53,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 12:35:53,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 12:35:53,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions.
[2024-05-12 12:35:53,638 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-05-12 12:35:53,638 INFO  L175             Difference]: Start difference. First operand has 321 places, 578 transitions, 9783 flow. Second operand 8 states and 184 transitions.
[2024-05-12 12:35:53,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 616 transitions, 11429 flow
[2024-05-12 12:35:55,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 616 transitions, 11176 flow, removed 101 selfloop flow, removed 5 redundant places.
[2024-05-12 12:35:55,403 INFO  L231             Difference]: Finished difference. Result has 324 places, 583 transitions, 9802 flow
[2024-05-12 12:35:55,403 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9536, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9802, PETRI_PLACES=324, PETRI_TRANSITIONS=583}
[2024-05-12 12:35:55,403 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 270 predicate places.
[2024-05-12 12:35:55,403 INFO  L495      AbstractCegarLoop]: Abstraction has has 324 places, 583 transitions, 9802 flow
[2024-05-12 12:35:55,403 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:35:55,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:35:55,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:35:55,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-05-12 12:35:55,404 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:35:55,404 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:35:55,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -1520050523, now seen corresponding path program 2 times
[2024-05-12 12:35:55,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:35:55,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640593126]
[2024-05-12 12:35:55,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:35:55,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:35:55,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:36:03,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:36:03,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:36:03,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640593126]
[2024-05-12 12:36:03,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640593126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:36:03,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:36:03,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:36:03,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664009214]
[2024-05-12 12:36:03,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:36:03,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:36:03,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:36:03,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:36:03,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:36:03,120 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:36:03,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 583 transitions, 9802 flow. Second operand  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:36:03,120 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:36:03,120 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:36:03,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:36:07,263 INFO  L124   PetriNetUnfolderBase]: 8238/12925 cut-off events.
[2024-05-12 12:36:07,264 INFO  L125   PetriNetUnfolderBase]: For 654313/654313 co-relation queries the response was YES.
[2024-05-12 12:36:07,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108064 conditions, 12925 events. 8238/12925 cut-off events. For 654313/654313 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 85894 event pairs, 2144 based on Foata normal form. 8/12693 useless extension candidates. Maximal degree in co-relation 107908. Up to 10987 conditions per place. 
[2024-05-12 12:36:07,437 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 527 selfloop transitions, 125 changer transitions 0/661 dead transitions.
[2024-05-12 12:36:07,437 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 661 transitions, 12447 flow
[2024-05-12 12:36:07,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:36:07,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:36:07,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions.
[2024-05-12 12:36:07,438 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4875
[2024-05-12 12:36:07,438 INFO  L175             Difference]: Start difference. First operand has 324 places, 583 transitions, 9802 flow. Second operand 10 states and 234 transitions.
[2024-05-12 12:36:07,439 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 661 transitions, 12447 flow
[2024-05-12 12:36:09,151 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 661 transitions, 12100 flow, removed 113 selfloop flow, removed 6 redundant places.
[2024-05-12 12:36:09,159 INFO  L231             Difference]: Finished difference. Result has 330 places, 613 transitions, 10613 flow
[2024-05-12 12:36:09,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9570, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10613, PETRI_PLACES=330, PETRI_TRANSITIONS=613}
[2024-05-12 12:36:09,159 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 276 predicate places.
[2024-05-12 12:36:09,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 613 transitions, 10613 flow
[2024-05-12 12:36:09,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:36:09,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:36:09,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:36:09,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-05-12 12:36:09,160 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:36:09,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:36:09,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -677808223, now seen corresponding path program 3 times
[2024-05-12 12:36:09,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:36:09,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677381359]
[2024-05-12 12:36:09,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:36:09,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:36:09,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:36:16,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:36:16,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:36:16,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677381359]
[2024-05-12 12:36:16,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677381359] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:36:16,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:36:16,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 12:36:16,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084957855]
[2024-05-12 12:36:16,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:36:16,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 12:36:16,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:36:16,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 12:36:16,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 12:36:16,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:36:16,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 613 transitions, 10613 flow. Second operand  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:36:16,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:36:16,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:36:16,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 12:36:21,509 INFO  L124   PetriNetUnfolderBase]: 8350/13065 cut-off events.
[2024-05-12 12:36:21,509 INFO  L125   PetriNetUnfolderBase]: For 689954/689954 co-relation queries the response was YES.
[2024-05-12 12:36:21,627 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 112788 conditions, 13065 events. 8350/13065 cut-off events. For 689954/689954 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 86691 event pairs, 2186 based on Foata normal form. 4/12833 useless extension candidates. Maximal degree in co-relation 112629. Up to 11071 conditions per place. 
[2024-05-12 12:36:21,702 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 534 selfloop transitions, 128 changer transitions 0/671 dead transitions.
[2024-05-12 12:36:21,702 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 671 transitions, 12841 flow
[2024-05-12 12:36:21,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 12:36:21,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 12:36:21,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions.
[2024-05-12 12:36:21,703 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48541666666666666
[2024-05-12 12:36:21,703 INFO  L175             Difference]: Start difference. First operand has 330 places, 613 transitions, 10613 flow. Second operand 10 states and 233 transitions.
[2024-05-12 12:36:21,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 671 transitions, 12841 flow
[2024-05-12 12:36:23,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 671 transitions, 12406 flow, removed 173 selfloop flow, removed 5 redundant places.
[2024-05-12 12:36:23,695 INFO  L231             Difference]: Finished difference. Result has 337 places, 628 transitions, 10941 flow
[2024-05-12 12:36:23,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10262, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10941, PETRI_PLACES=337, PETRI_TRANSITIONS=628}
[2024-05-12 12:36:23,695 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 283 predicate places.
[2024-05-12 12:36:23,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 337 places, 628 transitions, 10941 flow
[2024-05-12 12:36:23,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:36:23,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 12:36:23,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 12:36:23,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-05-12 12:36:23,696 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 12:36:23,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 12:36:23,696 INFO  L85        PathProgramCache]: Analyzing trace with hash 555181929, now seen corresponding path program 2 times
[2024-05-12 12:36:23,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 12:36:23,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130406395]
[2024-05-12 12:36:23,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 12:36:23,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 12:36:23,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 12:36:31,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 12:36:31,813 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 12:36:31,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130406395]
[2024-05-12 12:36:31,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130406395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 12:36:31,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 12:36:31,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 12:36:31,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631070694]
[2024-05-12 12:36:31,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 12:36:31,814 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 12:36:31,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 12:36:31,814 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 12:36:31,814 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 12:36:31,924 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 12:36:31,925 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 628 transitions, 10941 flow. Second operand  has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 12:36:31,925 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 12:36:31,925 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 12:36:31,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15