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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:41:45,335 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:41:45,399 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:41:45,404 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:41:45,404 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:41:45,428 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:41:45,428 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:41:45,429 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:41:45,429 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:41:45,432 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:41:45,432 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:41:45,433 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:41:45,433 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:41:45,435 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:41:45,435 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:41:45,435 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:41:45,435 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:41:45,435 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:41:45,436 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:41:45,436 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:41:45,437 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:41:45,437 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:41:45,438 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:41:45,438 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:41:45,438 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:41:45,438 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:41:45,438 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:41:45,439 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:41:45,439 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:41:45,439 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:41:45,440 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:41:45,440 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:41:45,440 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:41:45,441 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:41:45,441 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:41:45,441 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:41:45,441 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:41:45,441 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:41:45,442 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:41:45,442 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:41:45,442 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:41:45,442 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:41:45,442 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:41:45,442 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:41:45,640 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:41:45,655 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:41:45,658 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:41:45,659 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:41:45,659 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:41:45,660 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 19:41:46,633 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:41:46,843 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:41:46,843 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 19:41:46,861 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61de053f9/79a96d0db1464860b0c0f6d50520d843/FLAGf2f9d887f
[2024-06-20 19:41:46,874 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61de053f9/79a96d0db1464860b0c0f6d50520d843
[2024-06-20 19:41:46,878 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:41:46,878 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:41:46,880 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-20 19:41:47,019 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:41:47,020 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:41:47,021 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:41:47,021 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:41:47,025 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:41:47,025 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:41:46" (1/2) ...
[2024-06-20 19:41:47,026 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536c2531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:41:47, skipping insertion in model container
[2024-06-20 19:41:47,026 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:41:46" (1/2) ...
[2024-06-20 19:41:47,027 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@442aedb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:41:47, skipping insertion in model container
[2024-06-20 19:41:47,027 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:41:47" (2/2) ...
[2024-06-20 19:41:47,027 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536c2531 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47, skipping insertion in model container
[2024-06-20 19:41:47,028 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:41:47" (2/2) ...
[2024-06-20 19:41:47,028 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:41:47,113 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:41:47,114 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)
[2024-06-20 19:41:47,114 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)
[2024-06-20 19:41:47,115 INFO  L97    edCorrectnessWitness]: Location invariant before [L852-L852] ((((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)
[2024-06-20 19:41:47,115 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:41:47,116 INFO  L106   edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1;
[2024-06-20 19:41:47,153 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:41:47,395 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:41:47,404 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:41:47,688 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:41:47,716 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:41:47,716 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47 WrapperNode
[2024-06-20 19:41:47,716 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:41:47,717 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:41:47,717 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:41:47,717 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:41:47,722 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:47,759 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:47,936 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144
[2024-06-20 19:41:47,936 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:41:47,937 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:41:47,937 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:41:47,937 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:41:47,946 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:47,946 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:47,959 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:47,987 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 19:41:47,988 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:47,988 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:48,016 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:48,018 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:48,030 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:48,035 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:48,048 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:41:48,049 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:41:48,049 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:41:48,049 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:41:48,050 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (1/1) ...
[2024-06-20 19:41:48,054 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:41:48,060 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:41:48,081 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 19:41:48,102 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 19:41:48,119 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:41:48,120 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:41:48,120 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:41:48,120 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:41:48,120 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:41:48,121 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:41:48,121 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:41:48,121 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:41:48,121 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:41:48,121 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:41:48,121 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:41:48,122 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:41:48,123 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:41:48,251 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:41:48,253 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:41:49,211 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:41:49,212 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:41:49,493 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:41:49,493 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:41:49,494 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:41:49 BoogieIcfgContainer
[2024-06-20 19:41:49,494 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:41:49,496 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:41:49,496 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:41:49,499 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:41:49,499 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:41:46" (1/4) ...
[2024-06-20 19:41:49,500 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e801c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:41:49, skipping insertion in model container
[2024-06-20 19:41:49,500 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:41:47" (2/4) ...
[2024-06-20 19:41:49,500 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e801c6c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:41:49, skipping insertion in model container
[2024-06-20 19:41:49,500 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:41:47" (3/4) ...
[2024-06-20 19:41:49,501 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e801c6c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:41:49, skipping insertion in model container
[2024-06-20 19:41:49,501 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:41:49" (4/4) ...
[2024-06-20 19:41:49,502 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 19:41:49,516 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:41:49,516 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:41:49,517 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:41:49,627 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:41:49,655 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:41:49,700 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-20 19:41:49,700 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:41:49,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:41:49,701 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:41:49,704 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-20 19:41:49,714 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:41:49,720 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;@76f98966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:41:49,720 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:41:49,727 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:41:49,727 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-20 19:41:49,727 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:41:49,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:49,727 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:41:49,728 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:41:49,733 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:49,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 441899971, now seen corresponding path program 1 times
[2024-06-20 19:41:49,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:49,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953323979]
[2024-06-20 19:41:49,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:49,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:50,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:54,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:41:54,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:54,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953323979]
[2024-06-20 19:41:54,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953323979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:54,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:54,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:41:54,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911264736]
[2024-06-20 19:41:54,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:54,232 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:41:54,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:54,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:41:54,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:41:54,330 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:41:54,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:54,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:54,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:41:54,334 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:55,111 INFO  L124   PetriNetUnfolderBase]: 1354/2038 cut-off events.
[2024-06-20 19:41:55,112 INFO  L125   PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES.
[2024-06-20 19:41:55,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 2038 events. 1354/2038 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9585 event pairs, 709 based on Foata normal form. 4/2007 useless extension candidates. Maximal degree in co-relation 4138. Up to 2016 conditions per place. 
[2024-06-20 19:41:55,127 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 35 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-20 19:41:55,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 181 flow
[2024-06-20 19:41:55,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:41:55,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:41:55,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2024-06-20 19:41:55,136 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-20 19:41:55,138 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 72 transitions.
[2024-06-20 19:41:55,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 181 flow
[2024-06-20 19:41:55,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:41:55,142 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-20 19:41:55,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-20 19:41:55,146 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-20 19:41:55,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-20 19:41:55,146 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:55,146 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:55,146 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:55,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:41:55,147 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:41:55,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:55,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -535779076, now seen corresponding path program 1 times
[2024-06-20 19:41:55,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:55,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340365205]
[2024-06-20 19:41:55,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:55,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:55,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:58,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:41:58,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:58,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340365205]
[2024-06-20 19:41:58,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340365205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:58,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:58,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:41:58,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422246920]
[2024-06-20 19:41:58,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:58,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:41:58,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:58,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:41:58,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:41:58,289 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:41:58,290 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:58,290 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:58,290 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:41:58,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:58,953 INFO  L124   PetriNetUnfolderBase]: 1363/2050 cut-off events.
[2024-06-20 19:41:58,953 INFO  L125   PetriNetUnfolderBase]: For 316/319 co-relation queries the response was YES.
[2024-06-20 19:41:58,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 2050 events. 1363/2050 cut-off events. For 316/319 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9433 event pairs, 772 based on Foata normal form. 8/2057 useless extension candidates. Maximal degree in co-relation 4726. Up to 2013 conditions per place. 
[2024-06-20 19:41:58,963 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 45 selfloop transitions, 7 changer transitions 0/57 dead transitions.
[2024-06-20 19:41:58,963 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 266 flow
[2024-06-20 19:41:58,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:41:58,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:41:58,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-20 19:41:58,967 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.575
[2024-06-20 19:41:58,967 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 92 transitions.
[2024-06-20 19:41:58,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 266 flow
[2024-06-20 19:41:58,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:41:58,971 INFO  L231             Difference]: Finished difference. Result has 45 places, 40 transitions, 154 flow
[2024-06-20 19:41:58,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=40}
[2024-06-20 19:41:58,971 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2024-06-20 19:41:58,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 154 flow
[2024-06-20 19:41:58,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:58,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:58,973 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:58,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:41:58,975 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:41:58,975 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:58,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 570718658, now seen corresponding path program 1 times
[2024-06-20 19:41:58,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:58,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347030687]
[2024-06-20 19:41:58,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:58,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:59,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:01,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:01,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:01,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347030687]
[2024-06-20 19:42:01,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347030687] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:01,949 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:01,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:42:01,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143419649]
[2024-06-20 19:42:01,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:01,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:42:01,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:01,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:42:01,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:42:02,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:02,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 154 flow. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:02,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:02,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:02,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:02,867 INFO  L124   PetriNetUnfolderBase]: 1664/2484 cut-off events.
[2024-06-20 19:42:02,868 INFO  L125   PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES.
[2024-06-20 19:42:02,872 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6476 conditions, 2484 events. 1664/2484 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11396 event pairs, 791 based on Foata normal form. 6/2490 useless extension candidates. Maximal degree in co-relation 6461. Up to 2418 conditions per place. 
[2024-06-20 19:42:02,882 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 62 selfloop transitions, 10 changer transitions 0/76 dead transitions.
[2024-06-20 19:42:02,882 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 407 flow
[2024-06-20 19:42:02,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:42:02,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:42:02,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions.
[2024-06-20 19:42:02,887 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.555
[2024-06-20 19:42:02,887 INFO  L175             Difference]: Start difference. First operand has 45 places, 40 transitions, 154 flow. Second operand 5 states and 111 transitions.
[2024-06-20 19:42:02,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 407 flow
[2024-06-20 19:42:02,890 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 392 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-06-20 19:42:02,891 INFO  L231             Difference]: Finished difference. Result has 51 places, 49 transitions, 230 flow
[2024-06-20 19:42:02,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=49}
[2024-06-20 19:42:02,892 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places.
[2024-06-20 19:42:02,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 230 flow
[2024-06-20 19:42:02,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:02,893 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:02,893 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:02,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:42:02,893 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:02,893 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:02,894 INFO  L85        PathProgramCache]: Analyzing trace with hash 429293185, now seen corresponding path program 1 times
[2024-06-20 19:42:02,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:02,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134705750]
[2024-06-20 19:42:02,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:02,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:02,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:06,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:06,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:06,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134705750]
[2024-06-20 19:42:06,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134705750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:06,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:06,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:42:06,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658386688]
[2024-06-20 19:42:06,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:06,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:42:06,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:06,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:42:06,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:42:06,323 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:06,323 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 230 flow. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:06,323 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:06,323 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:06,324 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:07,284 INFO  L124   PetriNetUnfolderBase]: 1692/2524 cut-off events.
[2024-06-20 19:42:07,284 INFO  L125   PetriNetUnfolderBase]: For 2207/2207 co-relation queries the response was YES.
[2024-06-20 19:42:07,288 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 2524 events. 1692/2524 cut-off events. For 2207/2207 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11786 event pairs, 493 based on Foata normal form. 9/2533 useless extension candidates. Maximal degree in co-relation 7242. Up to 2382 conditions per place. 
[2024-06-20 19:42:07,295 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 73 selfloop transitions, 23 changer transitions 0/100 dead transitions.
[2024-06-20 19:42:07,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 586 flow
[2024-06-20 19:42:07,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:42:07,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:42:07,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-06-20 19:42:07,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5708333333333333
[2024-06-20 19:42:07,298 INFO  L175             Difference]: Start difference. First operand has 51 places, 49 transitions, 230 flow. Second operand 6 states and 137 transitions.
[2024-06-20 19:42:07,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 586 flow
[2024-06-20 19:42:07,303 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 100 transitions, 582 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-20 19:42:07,305 INFO  L231             Difference]: Finished difference. Result has 60 places, 63 transitions, 391 flow
[2024-06-20 19:42:07,305 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=63}
[2024-06-20 19:42:07,306 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places.
[2024-06-20 19:42:07,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 391 flow
[2024-06-20 19:42:07,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:07,307 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:07,307 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:07,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:42:07,307 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:07,307 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:07,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -1295155967, now seen corresponding path program 1 times
[2024-06-20 19:42:07,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:07,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212291214]
[2024-06-20 19:42:07,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:07,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:07,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:10,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:10,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:10,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212291214]
[2024-06-20 19:42:10,716 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212291214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:10,716 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:10,716 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:42:10,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851156122]
[2024-06-20 19:42:10,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:10,717 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:42:10,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:10,717 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:42:10,717 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:42:10,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:10,822 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 391 flow. Second operand  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:10,822 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:10,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:10,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:11,872 INFO  L124   PetriNetUnfolderBase]: 1754/2622 cut-off events.
[2024-06-20 19:42:11,873 INFO  L125   PetriNetUnfolderBase]: For 5317/5317 co-relation queries the response was YES.
[2024-06-20 19:42:11,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9185 conditions, 2622 events. 1754/2622 cut-off events. For 5317/5317 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12296 event pairs, 362 based on Foata normal form. 20/2642 useless extension candidates. Maximal degree in co-relation 9160. Up to 2368 conditions per place. 
[2024-06-20 19:42:11,891 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 82 selfloop transitions, 26 changer transitions 0/112 dead transitions.
[2024-06-20 19:42:11,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 771 flow
[2024-06-20 19:42:11,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:11,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:11,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions.
[2024-06-20 19:42:11,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5607142857142857
[2024-06-20 19:42:11,892 INFO  L175             Difference]: Start difference. First operand has 60 places, 63 transitions, 391 flow. Second operand 7 states and 157 transitions.
[2024-06-20 19:42:11,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 771 flow
[2024-06-20 19:42:11,901 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 753 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-06-20 19:42:11,903 INFO  L231             Difference]: Finished difference. Result has 66 places, 65 transitions, 448 flow
[2024-06-20 19:42:11,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=66, PETRI_TRANSITIONS=65}
[2024-06-20 19:42:11,905 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places.
[2024-06-20 19:42:11,905 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 448 flow
[2024-06-20 19:42:11,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:11,906 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:11,906 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:11,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:42:11,907 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:11,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:11,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 524203061, now seen corresponding path program 1 times
[2024-06-20 19:42:11,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:11,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779171305]
[2024-06-20 19:42:11,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:11,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:11,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:19,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:19,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:19,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779171305]
[2024-06-20 19:42:19,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779171305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:19,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:19,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:42:19,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076033815]
[2024-06-20 19:42:19,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:19,322 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:42:19,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:19,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:42:19,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:42:19,426 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:19,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 448 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:19,427 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:19,427 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:19,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:20,359 INFO  L124   PetriNetUnfolderBase]: 1774/2651 cut-off events.
[2024-06-20 19:42:20,360 INFO  L125   PetriNetUnfolderBase]: For 6578/6580 co-relation queries the response was YES.
[2024-06-20 19:42:20,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9884 conditions, 2651 events. 1774/2651 cut-off events. For 6578/6580 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12146 event pairs, 703 based on Foata normal form. 12/2663 useless extension candidates. Maximal degree in co-relation 9855. Up to 2565 conditions per place. 
[2024-06-20 19:42:20,374 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 69 selfloop transitions, 14 changer transitions 0/86 dead transitions.
[2024-06-20 19:42:20,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 694 flow
[2024-06-20 19:42:20,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:42:20,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:42:20,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-06-20 19:42:20,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445
[2024-06-20 19:42:20,375 INFO  L175             Difference]: Start difference. First operand has 66 places, 65 transitions, 448 flow. Second operand 5 states and 89 transitions.
[2024-06-20 19:42:20,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 694 flow
[2024-06-20 19:42:20,379 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 647 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-20 19:42:20,380 INFO  L231             Difference]: Finished difference. Result has 66 places, 70 transitions, 480 flow
[2024-06-20 19:42:20,380 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=66, PETRI_TRANSITIONS=70}
[2024-06-20 19:42:20,381 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places.
[2024-06-20 19:42:20,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 480 flow
[2024-06-20 19:42:20,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:20,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:20,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:20,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:42:20,382 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:20,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:20,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331719794, now seen corresponding path program 1 times
[2024-06-20 19:42:20,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:20,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456762380]
[2024-06-20 19:42:20,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:20,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:20,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:26,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:26,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:26,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456762380]
[2024-06-20 19:42:26,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456762380] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:26,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:26,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:42:26,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24074232]
[2024-06-20 19:42:26,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:26,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:42:26,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:26,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:42:26,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:42:26,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:26,821 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 480 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:26,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:26,821 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:26,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:27,750 INFO  L124   PetriNetUnfolderBase]: 1824/2721 cut-off events.
[2024-06-20 19:42:27,750 INFO  L125   PetriNetUnfolderBase]: For 8967/8971 co-relation queries the response was YES.
[2024-06-20 19:42:27,755 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10853 conditions, 2721 events. 1824/2721 cut-off events. For 8967/8971 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12666 event pairs, 606 based on Foata normal form. 9/2730 useless extension candidates. Maximal degree in co-relation 10822. Up to 2560 conditions per place. 
[2024-06-20 19:42:27,763 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 88 selfloop transitions, 21 changer transitions 0/112 dead transitions.
[2024-06-20 19:42:27,763 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 906 flow
[2024-06-20 19:42:27,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:27,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:27,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-20 19:42:27,764 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4607142857142857
[2024-06-20 19:42:27,764 INFO  L175             Difference]: Start difference. First operand has 66 places, 70 transitions, 480 flow. Second operand 7 states and 129 transitions.
[2024-06-20 19:42:27,764 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 906 flow
[2024-06-20 19:42:27,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 112 transitions, 865 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-06-20 19:42:27,769 INFO  L231             Difference]: Finished difference. Result has 70 places, 76 transitions, 543 flow
[2024-06-20 19:42:27,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=70, PETRI_TRANSITIONS=76}
[2024-06-20 19:42:27,770 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places.
[2024-06-20 19:42:27,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 543 flow
[2024-06-20 19:42:27,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:27,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:27,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:27,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:42:27,771 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:27,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:27,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -1502417574, now seen corresponding path program 2 times
[2024-06-20 19:42:27,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:27,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858933747]
[2024-06-20 19:42:27,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:27,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:27,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:34,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:34,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:34,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858933747]
[2024-06-20 19:42:34,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858933747] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:34,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:34,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:42:34,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535826237]
[2024-06-20 19:42:34,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:34,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:42:34,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:34,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:42:34,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:42:34,368 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:34,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 543 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:34,369 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:34,369 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:34,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:35,343 INFO  L124   PetriNetUnfolderBase]: 1876/2795 cut-off events.
[2024-06-20 19:42:35,344 INFO  L125   PetriNetUnfolderBase]: For 11825/11829 co-relation queries the response was YES.
[2024-06-20 19:42:35,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11773 conditions, 2795 events. 1876/2795 cut-off events. For 11825/11829 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13011 event pairs, 636 based on Foata normal form. 9/2804 useless extension candidates. Maximal degree in co-relation 11741. Up to 2683 conditions per place. 
[2024-06-20 19:42:35,356 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 91 selfloop transitions, 19 changer transitions 0/113 dead transitions.
[2024-06-20 19:42:35,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 113 transitions, 937 flow
[2024-06-20 19:42:35,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:35,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:35,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 19:42:35,358 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392857142857143
[2024-06-20 19:42:35,358 INFO  L175             Difference]: Start difference. First operand has 70 places, 76 transitions, 543 flow. Second operand 7 states and 123 transitions.
[2024-06-20 19:42:35,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 113 transitions, 937 flow
[2024-06-20 19:42:35,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 903 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 19:42:35,365 INFO  L231             Difference]: Finished difference. Result has 74 places, 82 transitions, 613 flow
[2024-06-20 19:42:35,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=613, PETRI_PLACES=74, PETRI_TRANSITIONS=82}
[2024-06-20 19:42:35,366 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places.
[2024-06-20 19:42:35,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 613 flow
[2024-06-20 19:42:35,366 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:35,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:35,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:35,366 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:42:35,367 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:35,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:35,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331714958, now seen corresponding path program 1 times
[2024-06-20 19:42:35,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:35,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081403579]
[2024-06-20 19:42:35,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:35,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:35,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:42,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:42,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:42,194 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081403579]
[2024-06-20 19:42:42,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081403579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:42,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:42,194 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:42:42,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462095512]
[2024-06-20 19:42:42,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:42,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:42:42,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:42,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:42:42,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:42:42,308 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:42,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 613 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:42,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:42,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:42,309 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:43,224 INFO  L124   PetriNetUnfolderBase]: 1898/2827 cut-off events.
[2024-06-20 19:42:43,224 INFO  L125   PetriNetUnfolderBase]: For 12779/12783 co-relation queries the response was YES.
[2024-06-20 19:42:43,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12227 conditions, 2827 events. 1898/2827 cut-off events. For 12779/12783 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13035 event pairs, 658 based on Foata normal form. 8/2835 useless extension candidates. Maximal degree in co-relation 12193. Up to 2702 conditions per place. 
[2024-06-20 19:42:43,239 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 103 selfloop transitions, 22 changer transitions 0/128 dead transitions.
[2024-06-20 19:42:43,240 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 128 transitions, 1089 flow
[2024-06-20 19:42:43,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:42:43,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:42:43,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-20 19:42:43,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415625
[2024-06-20 19:42:43,242 INFO  L175             Difference]: Start difference. First operand has 74 places, 82 transitions, 613 flow. Second operand 8 states and 133 transitions.
[2024-06-20 19:42:43,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 128 transitions, 1089 flow
[2024-06-20 19:42:43,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 128 transitions, 1026 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 19:42:43,254 INFO  L231             Difference]: Finished difference. Result has 80 places, 96 transitions, 741 flow
[2024-06-20 19:42:43,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=741, PETRI_PLACES=80, PETRI_TRANSITIONS=96}
[2024-06-20 19:42:43,254 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-20 19:42:43,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 741 flow
[2024-06-20 19:42:43,254 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:43,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:43,255 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:43,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:42:43,255 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:43,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:43,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -2105199520, now seen corresponding path program 2 times
[2024-06-20 19:42:43,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:43,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836771618]
[2024-06-20 19:42:43,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:43,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:43,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:49,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:49,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:49,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836771618]
[2024-06-20 19:42:49,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836771618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:49,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:49,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:42:49,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860425757]
[2024-06-20 19:42:49,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:49,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:42:49,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:49,512 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:42:49,512 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:42:49,643 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:49,643 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 741 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:49,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:49,644 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:49,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:50,616 INFO  L124   PetriNetUnfolderBase]: 1904/2836 cut-off events.
[2024-06-20 19:42:50,616 INFO  L125   PetriNetUnfolderBase]: For 15300/15302 co-relation queries the response was YES.
[2024-06-20 19:42:50,622 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12854 conditions, 2836 events. 1904/2836 cut-off events. For 15300/15302 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13057 event pairs, 679 based on Foata normal form. 6/2842 useless extension candidates. Maximal degree in co-relation 12817. Up to 2778 conditions per place. 
[2024-06-20 19:42:50,630 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 103 selfloop transitions, 16 changer transitions 0/122 dead transitions.
[2024-06-20 19:42:50,630 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 122 transitions, 1071 flow
[2024-06-20 19:42:50,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:50,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:50,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-20 19:42:50,633 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-20 19:42:50,633 INFO  L175             Difference]: Start difference. First operand has 80 places, 96 transitions, 741 flow. Second operand 7 states and 111 transitions.
[2024-06-20 19:42:50,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 122 transitions, 1071 flow
[2024-06-20 19:42:50,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 1033 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-20 19:42:50,649 INFO  L231             Difference]: Finished difference. Result has 86 places, 102 transitions, 797 flow
[2024-06-20 19:42:50,650 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=86, PETRI_TRANSITIONS=102}
[2024-06-20 19:42:50,651 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places.
[2024-06-20 19:42:50,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 102 transitions, 797 flow
[2024-06-20 19:42:50,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:50,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:50,653 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:50,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:42:50,653 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:50,653 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:50,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -2105206216, now seen corresponding path program 3 times
[2024-06-20 19:42:50,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:50,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262449020]
[2024-06-20 19:42:50,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:50,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:50,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:57,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:57,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:57,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262449020]
[2024-06-20 19:42:57,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262449020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:57,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:57,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:42:57,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071795269]
[2024-06-20 19:42:57,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:57,192 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:42:57,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:57,193 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:42:57,193 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:42:57,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:57,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 102 transitions, 797 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:57,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:57,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:57,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:58,265 INFO  L124   PetriNetUnfolderBase]: 1890/2817 cut-off events.
[2024-06-20 19:42:58,265 INFO  L125   PetriNetUnfolderBase]: For 18315/18317 co-relation queries the response was YES.
[2024-06-20 19:42:58,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13093 conditions, 2817 events. 1890/2817 cut-off events. For 18315/18317 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13100 event pairs, 585 based on Foata normal form. 7/2824 useless extension candidates. Maximal degree in co-relation 13053. Up to 2699 conditions per place. 
[2024-06-20 19:42:58,280 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 104 selfloop transitions, 22 changer transitions 0/129 dead transitions.
[2024-06-20 19:42:58,280 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 1144 flow
[2024-06-20 19:42:58,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:42:58,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:42:58,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-20 19:42:58,282 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-20 19:42:58,282 INFO  L175             Difference]: Start difference. First operand has 86 places, 102 transitions, 797 flow. Second operand 6 states and 110 transitions.
[2024-06-20 19:42:58,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 1144 flow
[2024-06-20 19:42:58,300 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 1100 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:42:58,302 INFO  L231             Difference]: Finished difference. Result has 88 places, 102 transitions, 811 flow
[2024-06-20 19:42:58,302 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=88, PETRI_TRANSITIONS=102}
[2024-06-20 19:42:58,303 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places.
[2024-06-20 19:42:58,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 102 transitions, 811 flow
[2024-06-20 19:42:58,303 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:58,303 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:58,303 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:58,303 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:42:58,303 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:58,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:58,304 INFO  L85        PathProgramCache]: Analyzing trace with hash -2104959952, now seen corresponding path program 1 times
[2024-06-20 19:42:58,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:58,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343806185]
[2024-06-20 19:42:58,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:58,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:58,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:05,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:05,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:05,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343806185]
[2024-06-20 19:43:05,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343806185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:05,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:05,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:05,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871761560]
[2024-06-20 19:43:05,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:05,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:05,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:05,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:05,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:05,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:05,221 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 811 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:05,221 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:05,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:05,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:06,206 INFO  L124   PetriNetUnfolderBase]: 1882/2805 cut-off events.
[2024-06-20 19:43:06,207 INFO  L125   PetriNetUnfolderBase]: For 19709/19711 co-relation queries the response was YES.
[2024-06-20 19:43:06,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13294 conditions, 2805 events. 1882/2805 cut-off events. For 19709/19711 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12868 event pairs, 657 based on Foata normal form. 6/2811 useless extension candidates. Maximal degree in co-relation 13253. Up to 2747 conditions per place. 
[2024-06-20 19:43:06,221 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 103 selfloop transitions, 14 changer transitions 0/120 dead transitions.
[2024-06-20 19:43:06,221 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 120 transitions, 1103 flow
[2024-06-20 19:43:06,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:43:06,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:43:06,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-20 19:43:06,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-20 19:43:06,224 INFO  L175             Difference]: Start difference. First operand has 88 places, 102 transitions, 811 flow. Second operand 6 states and 97 transitions.
[2024-06-20 19:43:06,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 120 transitions, 1103 flow
[2024-06-20 19:43:06,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 120 transitions, 1048 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 19:43:06,244 INFO  L231             Difference]: Finished difference. Result has 89 places, 104 transitions, 813 flow
[2024-06-20 19:43:06,244 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=813, PETRI_PLACES=89, PETRI_TRANSITIONS=104}
[2024-06-20 19:43:06,244 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places.
[2024-06-20 19:43:06,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 104 transitions, 813 flow
[2024-06-20 19:43:06,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:06,245 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:06,245 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:06,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:43:06,245 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:06,245 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:06,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 665973983, now seen corresponding path program 1 times
[2024-06-20 19:43:06,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:06,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475020649]
[2024-06-20 19:43:06,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:06,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:06,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:13,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:13,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:13,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475020649]
[2024-06-20 19:43:13,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475020649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:13,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:13,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:13,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152284528]
[2024-06-20 19:43:13,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:13,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:13,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:13,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:13,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:13,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:13,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 104 transitions, 813 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:13,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:13,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:13,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:14,882 INFO  L124   PetriNetUnfolderBase]: 1947/2895 cut-off events.
[2024-06-20 19:43:14,882 INFO  L125   PetriNetUnfolderBase]: For 23617/23617 co-relation queries the response was YES.
[2024-06-20 19:43:14,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 2895 events. 1947/2895 cut-off events. For 23617/23617 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13386 event pairs, 564 based on Foata normal form. 5/2900 useless extension candidates. Maximal degree in co-relation 13929. Up to 2612 conditions per place. 
[2024-06-20 19:43:14,897 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 119 selfloop transitions, 48 changer transitions 0/170 dead transitions.
[2024-06-20 19:43:14,897 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 170 transitions, 1495 flow
[2024-06-20 19:43:14,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:43:14,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:43:14,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-20 19:43:14,898 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:43:14,899 INFO  L175             Difference]: Start difference. First operand has 89 places, 104 transitions, 813 flow. Second operand 10 states and 180 transitions.
[2024-06-20 19:43:14,899 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 170 transitions, 1495 flow
[2024-06-20 19:43:14,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 170 transitions, 1456 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 19:43:14,917 INFO  L231             Difference]: Finished difference. Result has 96 places, 118 transitions, 1036 flow
[2024-06-20 19:43:14,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1036, PETRI_PLACES=96, PETRI_TRANSITIONS=118}
[2024-06-20 19:43:14,918 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places.
[2024-06-20 19:43:14,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 118 transitions, 1036 flow
[2024-06-20 19:43:14,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:14,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:14,918 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:14,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:43:14,918 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:14,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:14,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 665977858, now seen corresponding path program 1 times
[2024-06-20 19:43:14,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:14,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657014656]
[2024-06-20 19:43:14,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:14,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:14,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:21,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:21,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:21,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657014656]
[2024-06-20 19:43:21,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657014656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:21,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:21,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:21,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518856339]
[2024-06-20 19:43:21,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:21,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:21,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:21,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:21,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:21,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:21,514 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 118 transitions, 1036 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:21,514 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:21,514 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:21,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:22,598 INFO  L124   PetriNetUnfolderBase]: 2023/3005 cut-off events.
[2024-06-20 19:43:22,598 INFO  L125   PetriNetUnfolderBase]: For 27883/27883 co-relation queries the response was YES.
[2024-06-20 19:43:22,606 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15747 conditions, 3005 events. 2023/3005 cut-off events. For 27883/27883 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13856 event pairs, 532 based on Foata normal form. 8/3013 useless extension candidates. Maximal degree in co-relation 15703. Up to 2633 conditions per place. 
[2024-06-20 19:43:22,615 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 139 selfloop transitions, 45 changer transitions 0/187 dead transitions.
[2024-06-20 19:43:22,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 187 transitions, 1927 flow
[2024-06-20 19:43:22,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:43:22,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:43:22,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 19:43:22,618 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4527777777777778
[2024-06-20 19:43:22,618 INFO  L175             Difference]: Start difference. First operand has 96 places, 118 transitions, 1036 flow. Second operand 9 states and 163 transitions.
[2024-06-20 19:43:22,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 187 transitions, 1927 flow
[2024-06-20 19:43:22,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 187 transitions, 1808 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-20 19:43:22,640 INFO  L231             Difference]: Finished difference. Result has 100 places, 135 transitions, 1235 flow
[2024-06-20 19:43:22,641 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1235, PETRI_PLACES=100, PETRI_TRANSITIONS=135}
[2024-06-20 19:43:22,641 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places.
[2024-06-20 19:43:22,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 1235 flow
[2024-06-20 19:43:22,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:22,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:22,642 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:22,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:43:22,642 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:22,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:22,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 669702508, now seen corresponding path program 2 times
[2024-06-20 19:43:22,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:22,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354415763]
[2024-06-20 19:43:22,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:22,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:22,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:28,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:28,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:28,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354415763]
[2024-06-20 19:43:28,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354415763] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:28,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:28,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:28,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933809954]
[2024-06-20 19:43:28,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:28,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:28,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:28,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:28,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:29,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:29,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 1235 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:29,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:29,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:29,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:30,299 INFO  L124   PetriNetUnfolderBase]: 2109/3131 cut-off events.
[2024-06-20 19:43:30,299 INFO  L125   PetriNetUnfolderBase]: For 33159/33161 co-relation queries the response was YES.
[2024-06-20 19:43:30,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17442 conditions, 3131 events. 2109/3131 cut-off events. For 33159/33161 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14544 event pairs, 579 based on Foata normal form. 4/3135 useless extension candidates. Maximal degree in co-relation 17396. Up to 2770 conditions per place. 
[2024-06-20 19:43:30,318 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 146 selfloop transitions, 45 changer transitions 0/194 dead transitions.
[2024-06-20 19:43:30,318 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 194 transitions, 2069 flow
[2024-06-20 19:43:30,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:43:30,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:43:30,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 19:43:30,321 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4527777777777778
[2024-06-20 19:43:30,321 INFO  L175             Difference]: Start difference. First operand has 100 places, 135 transitions, 1235 flow. Second operand 9 states and 163 transitions.
[2024-06-20 19:43:30,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 194 transitions, 2069 flow
[2024-06-20 19:43:30,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 194 transitions, 1982 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-20 19:43:30,350 INFO  L231             Difference]: Finished difference. Result has 107 places, 145 transitions, 1392 flow
[2024-06-20 19:43:30,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1392, PETRI_PLACES=107, PETRI_TRANSITIONS=145}
[2024-06-20 19:43:30,351 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places.
[2024-06-20 19:43:30,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 145 transitions, 1392 flow
[2024-06-20 19:43:30,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:30,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:30,352 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:30,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:43:30,352 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:30,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:30,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1666504807, now seen corresponding path program 2 times
[2024-06-20 19:43:30,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:30,353 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734031741]
[2024-06-20 19:43:30,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:30,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:30,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:37,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:37,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:37,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734031741]
[2024-06-20 19:43:37,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734031741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:37,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:37,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:37,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081964794]
[2024-06-20 19:43:37,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:37,328 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:37,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:37,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:37,329 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:37,501 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:37,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 145 transitions, 1392 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:37,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:37,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:37,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:38,681 INFO  L124   PetriNetUnfolderBase]: 2095/3111 cut-off events.
[2024-06-20 19:43:38,681 INFO  L125   PetriNetUnfolderBase]: For 37324/37326 co-relation queries the response was YES.
[2024-06-20 19:43:38,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17904 conditions, 3111 events. 2095/3111 cut-off events. For 37324/37326 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14404 event pairs, 606 based on Foata normal form. 7/3118 useless extension candidates. Maximal degree in co-relation 17854. Up to 2888 conditions per place. 
[2024-06-20 19:43:38,702 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 130 selfloop transitions, 46 changer transitions 0/179 dead transitions.
[2024-06-20 19:43:38,702 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 179 transitions, 1872 flow
[2024-06-20 19:43:38,704 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:38,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:38,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-20 19:43:38,706 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46785714285714286
[2024-06-20 19:43:38,706 INFO  L175             Difference]: Start difference. First operand has 107 places, 145 transitions, 1392 flow. Second operand 7 states and 131 transitions.
[2024-06-20 19:43:38,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 179 transitions, 1872 flow
[2024-06-20 19:43:38,744 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 179 transitions, 1736 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-20 19:43:38,746 INFO  L231             Difference]: Finished difference. Result has 108 places, 145 transitions, 1371 flow
[2024-06-20 19:43:38,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1371, PETRI_PLACES=108, PETRI_TRANSITIONS=145}
[2024-06-20 19:43:38,747 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places.
[2024-06-20 19:43:38,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 145 transitions, 1371 flow
[2024-06-20 19:43:38,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:38,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:38,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:38,749 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:43:38,750 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:38,750 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:38,750 INFO  L85        PathProgramCache]: Analyzing trace with hash 669696928, now seen corresponding path program 3 times
[2024-06-20 19:43:38,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:38,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475562634]
[2024-06-20 19:43:38,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:38,751 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:38,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:45,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:45,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:45,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475562634]
[2024-06-20 19:43:45,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475562634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:45,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:45,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:45,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354292339]
[2024-06-20 19:43:45,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:45,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:45,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:45,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:45,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:45,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:45,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 145 transitions, 1371 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:45,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:45,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:45,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:46,823 INFO  L124   PetriNetUnfolderBase]: 2075/3084 cut-off events.
[2024-06-20 19:43:46,824 INFO  L125   PetriNetUnfolderBase]: For 39545/39547 co-relation queries the response was YES.
[2024-06-20 19:43:46,832 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17740 conditions, 3084 events. 2075/3084 cut-off events. For 39545/39547 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14339 event pairs, 576 based on Foata normal form. 8/3092 useless extension candidates. Maximal degree in co-relation 17689. Up to 2743 conditions per place. 
[2024-06-20 19:43:46,842 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 137 selfloop transitions, 42 changer transitions 0/182 dead transitions.
[2024-06-20 19:43:46,842 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 182 transitions, 2010 flow
[2024-06-20 19:43:46,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:46,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:46,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-20 19:43:46,847 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46785714285714286
[2024-06-20 19:43:46,847 INFO  L175             Difference]: Start difference. First operand has 108 places, 145 transitions, 1371 flow. Second operand 7 states and 131 transitions.
[2024-06-20 19:43:46,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 182 transitions, 2010 flow
[2024-06-20 19:43:46,878 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 182 transitions, 1892 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-20 19:43:46,880 INFO  L231             Difference]: Finished difference. Result has 109 places, 145 transitions, 1354 flow
[2024-06-20 19:43:46,880 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1354, PETRI_PLACES=109, PETRI_TRANSITIONS=145}
[2024-06-20 19:43:46,881 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places.
[2024-06-20 19:43:46,881 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 145 transitions, 1354 flow
[2024-06-20 19:43:46,881 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:46,881 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:46,881 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:46,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:43:46,882 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:46,882 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:46,882 INFO  L85        PathProgramCache]: Analyzing trace with hash -829524560, now seen corresponding path program 4 times
[2024-06-20 19:43:46,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:46,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687191495]
[2024-06-20 19:43:46,882 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:46,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:46,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:52,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:52,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:52,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687191495]
[2024-06-20 19:43:52,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687191495] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:52,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:52,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:52,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136462381]
[2024-06-20 19:43:52,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:52,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:52,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:52,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:52,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:52,970 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:52,970 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 145 transitions, 1354 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:52,970 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:52,970 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:52,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:54,029 INFO  L124   PetriNetUnfolderBase]: 2081/3093 cut-off events.
[2024-06-20 19:43:54,029 INFO  L125   PetriNetUnfolderBase]: For 42093/42095 co-relation queries the response was YES.
[2024-06-20 19:43:54,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17974 conditions, 3093 events. 2081/3093 cut-off events. For 42093/42095 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14353 event pairs, 605 based on Foata normal form. 6/3099 useless extension candidates. Maximal degree in co-relation 17922. Up to 3011 conditions per place. 
[2024-06-20 19:43:54,049 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 147 selfloop transitions, 19 changer transitions 0/169 dead transitions.
[2024-06-20 19:43:54,049 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 169 transitions, 1786 flow
[2024-06-20 19:43:54,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:54,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:54,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:43:54,052 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:43:54,052 INFO  L175             Difference]: Start difference. First operand has 109 places, 145 transitions, 1354 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:43:54,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 169 transitions, 1786 flow
[2024-06-20 19:43:54,085 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 169 transitions, 1698 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-06-20 19:43:54,087 INFO  L231             Difference]: Finished difference. Result has 110 places, 148 transitions, 1362 flow
[2024-06-20 19:43:54,087 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1362, PETRI_PLACES=110, PETRI_TRANSITIONS=148}
[2024-06-20 19:43:54,088 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places.
[2024-06-20 19:43:54,088 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 148 transitions, 1362 flow
[2024-06-20 19:43:54,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:54,088 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:54,088 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:54,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:43:54,089 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:54,089 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:54,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -829516903, now seen corresponding path program 1 times
[2024-06-20 19:43:54,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:54,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475428834]
[2024-06-20 19:43:54,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:54,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:54,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:00,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-06-20 19:44:00,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:00,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475428834]
[2024-06-20 19:44:00,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475428834] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:00,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:00,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:00,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344403889]
[2024-06-20 19:44:00,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:00,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:00,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:00,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:00,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:00,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:00,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 148 transitions, 1362 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:00,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:00,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:00,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:01,653 INFO  L124   PetriNetUnfolderBase]: 2076/3085 cut-off events.
[2024-06-20 19:44:01,654 INFO  L125   PetriNetUnfolderBase]: For 45725/45727 co-relation queries the response was YES.
[2024-06-20 19:44:01,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18105 conditions, 3085 events. 2076/3085 cut-off events. For 45725/45727 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14327 event pairs, 599 based on Foata normal form. 4/3089 useless extension candidates. Maximal degree in co-relation 18052. Up to 3018 conditions per place. 
[2024-06-20 19:44:01,675 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 143 selfloop transitions, 18 changer transitions 0/164 dead transitions.
[2024-06-20 19:44:01,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 1726 flow
[2024-06-20 19:44:01,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:44:01,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:44:01,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-20 19:44:01,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:44:01,678 INFO  L175             Difference]: Start difference. First operand has 110 places, 148 transitions, 1362 flow. Second operand 6 states and 98 transitions.
[2024-06-20 19:44:01,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 1726 flow
[2024-06-20 19:44:01,714 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 164 transitions, 1656 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-20 19:44:01,716 INFO  L231             Difference]: Finished difference. Result has 111 places, 148 transitions, 1340 flow
[2024-06-20 19:44:01,716 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1340, PETRI_PLACES=111, PETRI_TRANSITIONS=148}
[2024-06-20 19:44:01,716 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places.
[2024-06-20 19:44:01,717 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 148 transitions, 1340 flow
[2024-06-20 19:44:01,717 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:01,717 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:01,717 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:01,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:44:01,717 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:01,717 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:01,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -832383305, now seen corresponding path program 1 times
[2024-06-20 19:44:01,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:01,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869053400]
[2024-06-20 19:44:01,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:01,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:01,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:08,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-06-20 19:44:08,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:08,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869053400]
[2024-06-20 19:44:08,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869053400] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:08,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:08,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:08,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423663874]
[2024-06-20 19:44:08,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:08,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:08,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:08,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:08,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:09,138 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:09,139 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 148 transitions, 1340 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:09,139 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:09,139 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:09,139 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:10,401 INFO  L124   PetriNetUnfolderBase]: 2253/3356 cut-off events.
[2024-06-20 19:44:10,401 INFO  L125   PetriNetUnfolderBase]: For 55754/55756 co-relation queries the response was YES.
[2024-06-20 19:44:10,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19607 conditions, 3356 events. 2253/3356 cut-off events. For 55754/55756 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15898 event pairs, 459 based on Foata normal form. 18/3374 useless extension candidates. Maximal degree in co-relation 19553. Up to 2802 conditions per place. 
[2024-06-20 19:44:10,424 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 146 selfloop transitions, 62 changer transitions 0/211 dead transitions.
[2024-06-20 19:44:10,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 211 transitions, 2161 flow
[2024-06-20 19:44:10,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:10,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:10,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 19:44:10,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-20 19:44:10,426 INFO  L175             Difference]: Start difference. First operand has 111 places, 148 transitions, 1340 flow. Second operand 9 states and 172 transitions.
[2024-06-20 19:44:10,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 211 transitions, 2161 flow
[2024-06-20 19:44:10,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 211 transitions, 2117 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 19:44:10,469 INFO  L231             Difference]: Finished difference. Result has 116 places, 156 transitions, 1555 flow
[2024-06-20 19:44:10,469 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1555, PETRI_PLACES=116, PETRI_TRANSITIONS=156}
[2024-06-20 19:44:10,469 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places.
[2024-06-20 19:44:10,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 156 transitions, 1555 flow
[2024-06-20 19:44:10,470 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:10,470 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:10,470 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:10,470 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:44:10,470 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:10,470 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:10,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 117458837, now seen corresponding path program 2 times
[2024-06-20 19:44:10,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:10,471 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30478787]
[2024-06-20 19:44:10,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:10,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:10,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:17,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:17,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:17,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30478787]
[2024-06-20 19:44:17,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30478787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:17,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:17,306 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:17,306 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815119710]
[2024-06-20 19:44:17,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:17,306 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:17,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:17,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:17,307 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:17,508 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:17,509 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 156 transitions, 1555 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:17,509 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:17,509 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:17,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:18,737 INFO  L124   PetriNetUnfolderBase]: 2281/3400 cut-off events.
[2024-06-20 19:44:18,738 INFO  L125   PetriNetUnfolderBase]: For 55119/55121 co-relation queries the response was YES.
[2024-06-20 19:44:18,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20747 conditions, 3400 events. 2281/3400 cut-off events. For 55119/55121 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16233 event pairs, 570 based on Foata normal form. 4/3404 useless extension candidates. Maximal degree in co-relation 20691. Up to 2986 conditions per place. 
[2024-06-20 19:44:18,759 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 151 selfloop transitions, 64 changer transitions 0/218 dead transitions.
[2024-06-20 19:44:18,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 218 transitions, 2468 flow
[2024-06-20 19:44:18,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:18,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:18,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-20 19:44:18,761 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:44:18,761 INFO  L175             Difference]: Start difference. First operand has 116 places, 156 transitions, 1555 flow. Second operand 9 states and 162 transitions.
[2024-06-20 19:44:18,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 218 transitions, 2468 flow
[2024-06-20 19:44:18,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 218 transitions, 2359 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-20 19:44:18,809 INFO  L231             Difference]: Finished difference. Result has 121 places, 173 transitions, 1832 flow
[2024-06-20 19:44:18,809 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1832, PETRI_PLACES=121, PETRI_TRANSITIONS=173}
[2024-06-20 19:44:18,810 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places.
[2024-06-20 19:44:18,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 173 transitions, 1832 flow
[2024-06-20 19:44:18,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:18,810 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:18,810 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:18,810 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:44:18,810 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:18,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:18,811 INFO  L85        PathProgramCache]: Analyzing trace with hash 991208453, now seen corresponding path program 3 times
[2024-06-20 19:44:18,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:18,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399460756]
[2024-06-20 19:44:18,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:18,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:18,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:26,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:26,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:26,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399460756]
[2024-06-20 19:44:26,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399460756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:26,360 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:26,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:26,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513205921]
[2024-06-20 19:44:26,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:26,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:26,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:26,361 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:26,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:26,507 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:26,508 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 173 transitions, 1832 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:26,508 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:26,508 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:26,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:27,831 INFO  L124   PetriNetUnfolderBase]: 2357/3514 cut-off events.
[2024-06-20 19:44:27,831 INFO  L125   PetriNetUnfolderBase]: For 64048/64048 co-relation queries the response was YES.
[2024-06-20 19:44:27,843 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22140 conditions, 3514 events. 2357/3514 cut-off events. For 64048/64048 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16847 event pairs, 618 based on Foata normal form. 16/3530 useless extension candidates. Maximal degree in co-relation 22081. Up to 3239 conditions per place. 
[2024-06-20 19:44:27,853 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 176 selfloop transitions, 51 changer transitions 0/230 dead transitions.
[2024-06-20 19:44:27,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 230 transitions, 2576 flow
[2024-06-20 19:44:27,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:44:27,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:44:27,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-20 19:44:27,854 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44
[2024-06-20 19:44:27,854 INFO  L175             Difference]: Start difference. First operand has 121 places, 173 transitions, 1832 flow. Second operand 10 states and 176 transitions.
[2024-06-20 19:44:27,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 230 transitions, 2576 flow
[2024-06-20 19:44:27,903 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 230 transitions, 2480 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-20 19:44:27,906 INFO  L231             Difference]: Finished difference. Result has 128 places, 180 transitions, 1951 flow
[2024-06-20 19:44:27,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1951, PETRI_PLACES=128, PETRI_TRANSITIONS=180}
[2024-06-20 19:44:27,906 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places.
[2024-06-20 19:44:27,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 180 transitions, 1951 flow
[2024-06-20 19:44:27,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:27,906 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:27,906 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:27,907 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:44:27,907 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:27,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:27,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 991213227, now seen corresponding path program 1 times
[2024-06-20 19:44:27,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:27,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233524247]
[2024-06-20 19:44:27,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:27,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:27,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:35,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:35,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:35,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233524247]
[2024-06-20 19:44:35,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233524247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:35,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:35,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:35,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008173914]
[2024-06-20 19:44:35,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:35,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:35,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:35,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:35,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:35,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:35,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 180 transitions, 1951 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:35,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:35,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:35,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:36,688 INFO  L124   PetriNetUnfolderBase]: 2347/3500 cut-off events.
[2024-06-20 19:44:36,688 INFO  L125   PetriNetUnfolderBase]: For 65277/65277 co-relation queries the response was YES.
[2024-06-20 19:44:36,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22322 conditions, 3500 events. 2347/3500 cut-off events. For 65277/65277 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16864 event pairs, 568 based on Foata normal form. 4/3504 useless extension candidates. Maximal degree in co-relation 22261. Up to 3206 conditions per place. 
[2024-06-20 19:44:36,712 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 165 selfloop transitions, 52 changer transitions 0/220 dead transitions.
[2024-06-20 19:44:36,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 220 transitions, 2585 flow
[2024-06-20 19:44:36,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:36,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:36,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-20 19:44:36,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-20 19:44:36,714 INFO  L175             Difference]: Start difference. First operand has 128 places, 180 transitions, 1951 flow. Second operand 9 states and 157 transitions.
[2024-06-20 19:44:36,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 220 transitions, 2585 flow
[2024-06-20 19:44:36,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 220 transitions, 2464 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-20 19:44:36,784 INFO  L231             Difference]: Finished difference. Result has 130 places, 180 transitions, 1946 flow
[2024-06-20 19:44:36,784 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1946, PETRI_PLACES=130, PETRI_TRANSITIONS=180}
[2024-06-20 19:44:36,784 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places.
[2024-06-20 19:44:36,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 180 transitions, 1946 flow
[2024-06-20 19:44:36,785 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:36,785 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:36,785 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:36,785 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:44:36,785 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:36,785 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:36,786 INFO  L85        PathProgramCache]: Analyzing trace with hash -714235175, now seen corresponding path program 4 times
[2024-06-20 19:44:36,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:36,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392946153]
[2024-06-20 19:44:36,786 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:36,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:36,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:43,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:43,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:43,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392946153]
[2024-06-20 19:44:43,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392946153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:43,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:43,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:43,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128146832]
[2024-06-20 19:44:43,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:43,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:43,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:43,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:43,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:43,666 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:43,666 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 180 transitions, 1946 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:43,666 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:43,666 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:43,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:45,091 INFO  L124   PetriNetUnfolderBase]: 2419/3634 cut-off events.
[2024-06-20 19:44:45,091 INFO  L125   PetriNetUnfolderBase]: For 75055/75057 co-relation queries the response was YES.
[2024-06-20 19:44:45,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22925 conditions, 3634 events. 2419/3634 cut-off events. For 75055/75057 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17857 event pairs, 489 based on Foata normal form. 28/3662 useless extension candidates. Maximal degree in co-relation 22863. Up to 3126 conditions per place. 
[2024-06-20 19:44:45,111 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 169 selfloop transitions, 54 changer transitions 0/226 dead transitions.
[2024-06-20 19:44:45,112 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 226 transitions, 2663 flow
[2024-06-20 19:44:45,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:44:45,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:44:45,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-20 19:44:45,114 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.478125
[2024-06-20 19:44:45,114 INFO  L175             Difference]: Start difference. First operand has 130 places, 180 transitions, 1946 flow. Second operand 8 states and 153 transitions.
[2024-06-20 19:44:45,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 226 transitions, 2663 flow
[2024-06-20 19:44:45,182 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 226 transitions, 2555 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-20 19:44:45,184 INFO  L231             Difference]: Finished difference. Result has 133 places, 183 transitions, 2034 flow
[2024-06-20 19:44:45,185 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2034, PETRI_PLACES=133, PETRI_TRANSITIONS=183}
[2024-06-20 19:44:45,185 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 92 predicate places.
[2024-06-20 19:44:45,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 183 transitions, 2034 flow
[2024-06-20 19:44:45,185 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:45,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:45,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:45,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:44:45,186 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:45,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:45,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -1072393837, now seen corresponding path program 1 times
[2024-06-20 19:44:45,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:45,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10248752]
[2024-06-20 19:44:45,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:45,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:45,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:52,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:52,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:52,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10248752]
[2024-06-20 19:44:52,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10248752] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:52,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:52,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:52,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111853975]
[2024-06-20 19:44:52,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:52,627 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:52,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:52,628 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:52,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:52,779 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:52,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 183 transitions, 2034 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:52,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:52,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:52,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:54,147 INFO  L124   PetriNetUnfolderBase]: 2637/3954 cut-off events.
[2024-06-20 19:44:54,147 INFO  L125   PetriNetUnfolderBase]: For 90598/90600 co-relation queries the response was YES.
[2024-06-20 19:44:54,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25360 conditions, 3954 events. 2637/3954 cut-off events. For 90598/90600 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19828 event pairs, 607 based on Foata normal form. 26/3980 useless extension candidates. Maximal degree in co-relation 25296. Up to 3569 conditions per place. 
[2024-06-20 19:44:54,173 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 197 selfloop transitions, 54 changer transitions 0/254 dead transitions.
[2024-06-20 19:44:54,173 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 254 transitions, 3072 flow
[2024-06-20 19:44:54,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:54,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:54,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 19:44:54,174 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-20 19:44:54,174 INFO  L175             Difference]: Start difference. First operand has 133 places, 183 transitions, 2034 flow. Second operand 9 states and 172 transitions.
[2024-06-20 19:44:54,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 254 transitions, 3072 flow
[2024-06-20 19:44:54,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 254 transitions, 2935 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-20 19:44:54,266 INFO  L231             Difference]: Finished difference. Result has 140 places, 206 transitions, 2369 flow
[2024-06-20 19:44:54,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2369, PETRI_PLACES=140, PETRI_TRANSITIONS=206}
[2024-06-20 19:44:54,266 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 99 predicate places.
[2024-06-20 19:44:54,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 206 transitions, 2369 flow
[2024-06-20 19:44:54,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:44:54,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:54,267 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:54,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:44:54,267 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:54,267 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:54,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 63121551, now seen corresponding path program 2 times
[2024-06-20 19:44:54,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:54,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427070975]
[2024-06-20 19:44:54,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:54,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:54,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:00,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:00,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:00,939 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427070975]
[2024-06-20 19:45:00,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427070975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:00,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:00,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:00,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699007446]
[2024-06-20 19:45:00,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:00,939 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:00,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:00,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:00,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:01,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:01,107 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 206 transitions, 2369 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:45:01,107 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:01,107 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:01,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:02,427 INFO  L124   PetriNetUnfolderBase]: 2654/3981 cut-off events.
[2024-06-20 19:45:02,428 INFO  L125   PetriNetUnfolderBase]: For 98094/98096 co-relation queries the response was YES.
[2024-06-20 19:45:02,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27093 conditions, 3981 events. 2654/3981 cut-off events. For 98094/98096 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19885 event pairs, 660 based on Foata normal form. 6/3987 useless extension candidates. Maximal degree in co-relation 27024. Up to 3900 conditions per place. 
[2024-06-20 19:45:02,455 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 210 selfloop transitions, 16 changer transitions 0/229 dead transitions.
[2024-06-20 19:45:02,455 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 229 transitions, 2909 flow
[2024-06-20 19:45:02,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:45:02,457 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:45:02,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-20 19:45:02,457 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-20 19:45:02,457 INFO  L175             Difference]: Start difference. First operand has 140 places, 206 transitions, 2369 flow. Second operand 7 states and 111 transitions.
[2024-06-20 19:45:02,457 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 229 transitions, 2909 flow
[2024-06-20 19:45:02,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 229 transitions, 2801 flow, removed 53 selfloop flow, removed 1 redundant places.
[2024-06-20 19:45:02,550 INFO  L231             Difference]: Finished difference. Result has 146 places, 208 transitions, 2340 flow
[2024-06-20 19:45:02,550 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2340, PETRI_PLACES=146, PETRI_TRANSITIONS=208}
[2024-06-20 19:45:02,550 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 105 predicate places.
[2024-06-20 19:45:02,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 208 transitions, 2340 flow
[2024-06-20 19:45:02,551 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:45:02,551 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:02,551 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:02,551 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:45:02,551 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:02,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:02,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 62824633, now seen corresponding path program 1 times
[2024-06-20 19:45:02,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:02,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067866270]
[2024-06-20 19:45:02,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:02,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:02,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:09,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:09,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:09,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067866270]
[2024-06-20 19:45:09,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067866270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:09,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:09,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:09,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721836327]
[2024-06-20 19:45:09,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:09,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:09,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:09,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:09,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:09,523 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:09,523 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 208 transitions, 2340 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:45:09,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:09,523 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:09,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:10,826 INFO  L124   PetriNetUnfolderBase]: 2634/3941 cut-off events.
[2024-06-20 19:45:10,826 INFO  L125   PetriNetUnfolderBase]: For 101780/101782 co-relation queries the response was YES.
[2024-06-20 19:45:10,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26819 conditions, 3941 events. 2634/3941 cut-off events. For 101780/101782 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19552 event pairs, 671 based on Foata normal form. 4/3945 useless extension candidates. Maximal degree in co-relation 26747. Up to 3842 conditions per place. 
[2024-06-20 19:45:10,852 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 203 selfloop transitions, 24 changer transitions 0/230 dead transitions.
[2024-06-20 19:45:10,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 230 transitions, 2870 flow
[2024-06-20 19:45:10,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:45:10,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:45:10,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:45:10,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:45:10,855 INFO  L175             Difference]: Start difference. First operand has 146 places, 208 transitions, 2340 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:45:10,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 230 transitions, 2870 flow
[2024-06-20 19:45:10,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 230 transitions, 2785 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:10,988 INFO  L231             Difference]: Finished difference. Result has 148 places, 209 transitions, 2337 flow
[2024-06-20 19:45:10,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2337, PETRI_PLACES=148, PETRI_TRANSITIONS=209}
[2024-06-20 19:45:10,989 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places.
[2024-06-20 19:45:10,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 209 transitions, 2337 flow
[2024-06-20 19:45:10,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:45:10,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:10,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:10,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:45:10,990 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:10,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:10,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 62824881, now seen corresponding path program 3 times
[2024-06-20 19:45:10,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:10,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758966900]
[2024-06-20 19:45:10,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:10,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:11,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:17,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:17,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:17,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758966900]
[2024-06-20 19:45:17,888 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758966900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:17,888 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:17,888 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:17,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116957624]
[2024-06-20 19:45:17,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:17,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:17,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:17,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:17,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:18,044 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:18,044 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 209 transitions, 2337 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:45:18,044 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:18,044 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:18,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:19,341 INFO  L124   PetriNetUnfolderBase]: 2626/3929 cut-off events.
[2024-06-20 19:45:19,341 INFO  L125   PetriNetUnfolderBase]: For 106741/106743 co-relation queries the response was YES.
[2024-06-20 19:45:19,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26805 conditions, 3929 events. 2626/3929 cut-off events. For 106741/106743 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19459 event pairs, 669 based on Foata normal form. 6/3935 useless extension candidates. Maximal degree in co-relation 26732. Up to 3839 conditions per place. 
[2024-06-20 19:45:19,372 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 209 selfloop transitions, 20 changer transitions 0/232 dead transitions.
[2024-06-20 19:45:19,372 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 232 transitions, 2889 flow
[2024-06-20 19:45:19,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:45:19,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:45:19,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-20 19:45:19,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:45:19,373 INFO  L175             Difference]: Start difference. First operand has 148 places, 209 transitions, 2337 flow. Second operand 7 states and 112 transitions.
[2024-06-20 19:45:19,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 232 transitions, 2889 flow
[2024-06-20 19:45:19,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 232 transitions, 2839 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:19,500 INFO  L231             Difference]: Finished difference. Result has 150 places, 211 transitions, 2379 flow
[2024-06-20 19:45:19,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2379, PETRI_PLACES=150, PETRI_TRANSITIONS=211}
[2024-06-20 19:45:19,500 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places.
[2024-06-20 19:45:19,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 211 transitions, 2379 flow
[2024-06-20 19:45:19,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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-06-20 19:45:19,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:19,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:19,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:45:19,501 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:19,501 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:19,502 INFO  L85        PathProgramCache]: Analyzing trace with hash 1912667077, now seen corresponding path program 1 times
[2024-06-20 19:45:19,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:19,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399690427]
[2024-06-20 19:45:19,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:19,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:19,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:27,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:27,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:27,175 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399690427]
[2024-06-20 19:45:27,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399690427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:27,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:27,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:45:27,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167665345]
[2024-06-20 19:45:27,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:27,175 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:45:27,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:27,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:45:27,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:45:27,277 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:45:27,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 211 transitions, 2379 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:27,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:27,278 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:45:27,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:28,334 INFO  L124   PetriNetUnfolderBase]: 2401/3624 cut-off events.
[2024-06-20 19:45:28,334 INFO  L125   PetriNetUnfolderBase]: For 111273/111317 co-relation queries the response was YES.
[2024-06-20 19:45:28,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25227 conditions, 3624 events. 2401/3624 cut-off events. For 111273/111317 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18030 event pairs, 599 based on Foata normal form. 40/3637 useless extension candidates. Maximal degree in co-relation 25153. Up to 3415 conditions per place. 
[2024-06-20 19:45:28,362 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 178 selfloop transitions, 36 changer transitions 0/232 dead transitions.
[2024-06-20 19:45:28,362 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 232 transitions, 2939 flow
[2024-06-20 19:45:28,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:45:28,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:45:28,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions.
[2024-06-20 19:45:28,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.465
[2024-06-20 19:45:28,364 INFO  L175             Difference]: Start difference. First operand has 150 places, 211 transitions, 2379 flow. Second operand 5 states and 93 transitions.
[2024-06-20 19:45:28,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 232 transitions, 2939 flow
[2024-06-20 19:45:28,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 232 transitions, 2841 flow, removed 31 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:28,482 INFO  L231             Difference]: Finished difference. Result has 150 places, 216 transitions, 2467 flow
[2024-06-20 19:45:28,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2467, PETRI_PLACES=150, PETRI_TRANSITIONS=216}
[2024-06-20 19:45:28,483 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places.
[2024-06-20 19:45:28,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 216 transitions, 2467 flow
[2024-06-20 19:45:28,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:28,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:28,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:28,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:45:28,484 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:28,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:28,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -400253345, now seen corresponding path program 1 times
[2024-06-20 19:45:28,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:28,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302144823]
[2024-06-20 19:45:28,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:28,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:28,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:35,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:35,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:35,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302144823]
[2024-06-20 19:45:35,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302144823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:35,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:35,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:35,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364986483]
[2024-06-20 19:45:35,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:35,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:35,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:35,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:35,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:36,113 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:36,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 216 transitions, 2467 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:45:36,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:36,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:36,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:38,210 INFO  L124   PetriNetUnfolderBase]: 3687/5613 cut-off events.
[2024-06-20 19:45:38,210 INFO  L125   PetriNetUnfolderBase]: For 220889/220889 co-relation queries the response was YES.
[2024-06-20 19:45:38,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39049 conditions, 5613 events. 3687/5613 cut-off events. For 220889/220889 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 30358 event pairs, 790 based on Foata normal form. 72/5685 useless extension candidates. Maximal degree in co-relation 38974. Up to 2867 conditions per place. 
[2024-06-20 19:45:38,255 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 207 selfloop transitions, 98 changer transitions 5/313 dead transitions.
[2024-06-20 19:45:38,256 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 313 transitions, 3993 flow
[2024-06-20 19:45:38,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:45:38,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:45:38,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions.
[2024-06-20 19:45:38,257 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 19:45:38,257 INFO  L175             Difference]: Start difference. First operand has 150 places, 216 transitions, 2467 flow. Second operand 11 states and 220 transitions.
[2024-06-20 19:45:38,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 313 transitions, 3993 flow
[2024-06-20 19:45:38,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 313 transitions, 3929 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-20 19:45:38,444 INFO  L231             Difference]: Finished difference. Result has 161 places, 230 transitions, 2975 flow
[2024-06-20 19:45:38,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2975, PETRI_PLACES=161, PETRI_TRANSITIONS=230}
[2024-06-20 19:45:38,444 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places.
[2024-06-20 19:45:38,444 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 230 transitions, 2975 flow
[2024-06-20 19:45:38,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:45:38,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:38,445 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:38,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:45:38,445 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:38,445 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:38,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -32203263, now seen corresponding path program 2 times
[2024-06-20 19:45:38,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:38,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336706570]
[2024-06-20 19:45:38,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:38,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:38,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:45,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:45,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:45,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336706570]
[2024-06-20 19:45:45,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336706570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:45,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:45,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:45,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122758189]
[2024-06-20 19:45:45,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:45,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:45,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:45,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:45,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:46,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:46,126 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 230 transitions, 2975 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:45:46,126 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:46,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:46,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:48,670 INFO  L124   PetriNetUnfolderBase]: 4695/7205 cut-off events.
[2024-06-20 19:45:48,671 INFO  L125   PetriNetUnfolderBase]: For 318865/318865 co-relation queries the response was YES.
[2024-06-20 19:45:48,708 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54031 conditions, 7205 events. 4695/7205 cut-off events. For 318865/318865 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 41255 event pairs, 1485 based on Foata normal form. 72/7277 useless extension candidates. Maximal degree in co-relation 53952. Up to 5022 conditions per place. 
[2024-06-20 19:45:48,731 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 221 selfloop transitions, 98 changer transitions 1/323 dead transitions.
[2024-06-20 19:45:48,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 323 transitions, 4543 flow
[2024-06-20 19:45:48,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 19:45:48,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 19:45:48,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions.
[2024-06-20 19:45:48,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48541666666666666
[2024-06-20 19:45:48,733 INFO  L175             Difference]: Start difference. First operand has 161 places, 230 transitions, 2975 flow. Second operand 12 states and 233 transitions.
[2024-06-20 19:45:48,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 323 transitions, 4543 flow
[2024-06-20 19:45:49,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 323 transitions, 4408 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:49,013 INFO  L231             Difference]: Finished difference. Result has 169 places, 241 transitions, 3323 flow
[2024-06-20 19:45:49,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2862, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3323, PETRI_PLACES=169, PETRI_TRANSITIONS=241}
[2024-06-20 19:45:49,013 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places.
[2024-06-20 19:45:49,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 241 transitions, 3323 flow
[2024-06-20 19:45:49,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:45:49,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:49,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:49,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:45:49,014 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:49,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:49,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 576004347, now seen corresponding path program 3 times
[2024-06-20 19:45:49,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:49,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340246693]
[2024-06-20 19:45:49,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:49,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:49,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:56,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:56,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:56,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340246693]
[2024-06-20 19:45:56,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340246693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:56,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:56,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:56,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916648612]
[2024-06-20 19:45:56,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:56,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:56,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:56,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:56,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:56,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:56,891 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 241 transitions, 3323 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:45:56,891 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:56,891 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:56,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:59,574 INFO  L124   PetriNetUnfolderBase]: 4907/7559 cut-off events.
[2024-06-20 19:45:59,575 INFO  L125   PetriNetUnfolderBase]: For 346118/346118 co-relation queries the response was YES.
[2024-06-20 19:45:59,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55967 conditions, 7559 events. 4907/7559 cut-off events. For 346118/346118 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 43867 event pairs, 1739 based on Foata normal form. 104/7663 useless extension candidates. Maximal degree in co-relation 55885. Up to 6484 conditions per place. 
[2024-06-20 19:45:59,640 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 219 selfloop transitions, 98 changer transitions 0/320 dead transitions.
[2024-06-20 19:45:59,640 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 320 transitions, 4591 flow
[2024-06-20 19:45:59,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 19:45:59,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 19:45:59,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions.
[2024-06-20 19:45:59,641 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47291666666666665
[2024-06-20 19:45:59,642 INFO  L175             Difference]: Start difference. First operand has 169 places, 241 transitions, 3323 flow. Second operand 12 states and 227 transitions.
[2024-06-20 19:45:59,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 320 transitions, 4591 flow
[2024-06-20 19:46:00,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 320 transitions, 4424 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-20 19:46:00,089 INFO  L231             Difference]: Finished difference. Result has 175 places, 249 transitions, 3564 flow
[2024-06-20 19:46:00,090 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3164, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3564, PETRI_PLACES=175, PETRI_TRANSITIONS=249}
[2024-06-20 19:46:00,090 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places.
[2024-06-20 19:46:00,090 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 249 transitions, 3564 flow
[2024-06-20 19:46:00,090 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:00,090 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:00,090 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:00,090 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:46:00,091 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:00,091 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:00,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 662840307, now seen corresponding path program 4 times
[2024-06-20 19:46:00,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:00,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137481767]
[2024-06-20 19:46:00,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:00,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:00,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:08,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:08,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:08,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137481767]
[2024-06-20 19:46:08,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137481767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:08,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:08,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:08,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234231769]
[2024-06-20 19:46:08,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:08,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:08,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:08,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:08,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:08,349 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:08,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 249 transitions, 3564 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:08,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:08,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:08,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:10,938 INFO  L124   PetriNetUnfolderBase]: 4932/7606 cut-off events.
[2024-06-20 19:46:10,938 INFO  L125   PetriNetUnfolderBase]: For 324784/324784 co-relation queries the response was YES.
[2024-06-20 19:46:10,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57480 conditions, 7606 events. 4932/7606 cut-off events. For 324784/324784 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 44636 event pairs, 1844 based on Foata normal form. 20/7626 useless extension candidates. Maximal degree in co-relation 57395. Up to 7176 conditions per place. 
[2024-06-20 19:46:11,018 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 239 selfloop transitions, 56 changer transitions 0/298 dead transitions.
[2024-06-20 19:46:11,018 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 298 transitions, 4359 flow
[2024-06-20 19:46:11,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:46:11,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:46:11,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-20 19:46:11,021 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-20 19:46:11,021 INFO  L175             Difference]: Start difference. First operand has 175 places, 249 transitions, 3564 flow. Second operand 10 states and 173 transitions.
[2024-06-20 19:46:11,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 298 transitions, 4359 flow
[2024-06-20 19:46:11,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 298 transitions, 4094 flow, removed 45 selfloop flow, removed 9 redundant places.
[2024-06-20 19:46:11,444 INFO  L231             Difference]: Finished difference. Result has 176 places, 251 transitions, 3478 flow
[2024-06-20 19:46:11,445 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3299, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3478, PETRI_PLACES=176, PETRI_TRANSITIONS=251}
[2024-06-20 19:46:11,445 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places.
[2024-06-20 19:46:11,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 251 transitions, 3478 flow
[2024-06-20 19:46:11,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:11,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:11,445 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:11,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:46:11,445 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:11,446 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:11,446 INFO  L85        PathProgramCache]: Analyzing trace with hash -52530577, now seen corresponding path program 1 times
[2024-06-20 19:46:11,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:11,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141762876]
[2024-06-20 19:46:11,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:11,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:11,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:19,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:19,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:19,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141762876]
[2024-06-20 19:46:19,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141762876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:19,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:19,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:46:19,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737531943]
[2024-06-20 19:46:19,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:19,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:46:19,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:19,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:46:19,855 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:46:20,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:20,089 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 251 transitions, 3478 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:20,089 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:20,089 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:20,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:23,211 INFO  L124   PetriNetUnfolderBase]: 5265/8080 cut-off events.
[2024-06-20 19:46:23,211 INFO  L125   PetriNetUnfolderBase]: For 365191/365193 co-relation queries the response was YES.
[2024-06-20 19:46:23,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61261 conditions, 8080 events. 5265/8080 cut-off events. For 365191/365193 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 47491 event pairs, 1847 based on Foata normal form. 26/8106 useless extension candidates. Maximal degree in co-relation 61175. Up to 7356 conditions per place. 
[2024-06-20 19:46:23,288 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 245 selfloop transitions, 101 changer transitions 0/349 dead transitions.
[2024-06-20 19:46:23,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 349 transitions, 5130 flow
[2024-06-20 19:46:23,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 19:46:23,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 19:46:23,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions.
[2024-06-20 19:46:23,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4875
[2024-06-20 19:46:23,289 INFO  L175             Difference]: Start difference. First operand has 176 places, 251 transitions, 3478 flow. Second operand 12 states and 234 transitions.
[2024-06-20 19:46:23,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 349 transitions, 5130 flow
[2024-06-20 19:46:23,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 349 transitions, 5002 flow, removed 11 selfloop flow, removed 8 redundant places.
[2024-06-20 19:46:23,740 INFO  L231             Difference]: Finished difference. Result has 182 places, 279 transitions, 4142 flow
[2024-06-20 19:46:23,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4142, PETRI_PLACES=182, PETRI_TRANSITIONS=279}
[2024-06-20 19:46:23,741 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places.
[2024-06-20 19:46:23,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 279 transitions, 4142 flow
[2024-06-20 19:46:23,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:23,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:23,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:23,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:46:23,741 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:23,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:23,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -52523137, now seen corresponding path program 2 times
[2024-06-20 19:46:23,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:23,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40155252]
[2024-06-20 19:46:23,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:23,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:23,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:31,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:31,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:31,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40155252]
[2024-06-20 19:46:31,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40155252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:31,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:31,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:46:31,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848301098]
[2024-06-20 19:46:31,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:31,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:46:31,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:31,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:46:31,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:46:31,437 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:31,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 279 transitions, 4142 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:31,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:31,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:31,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:34,612 INFO  L124   PetriNetUnfolderBase]: 5821/8948 cut-off events.
[2024-06-20 19:46:34,612 INFO  L125   PetriNetUnfolderBase]: For 479019/479021 co-relation queries the response was YES.
[2024-06-20 19:46:34,666 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72497 conditions, 8948 events. 5821/8948 cut-off events. For 479019/479021 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 53803 event pairs, 1950 based on Foata normal form. 20/8968 useless extension candidates. Maximal degree in co-relation 72408. Up to 7309 conditions per place. 
[2024-06-20 19:46:34,700 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 252 selfloop transitions, 110 changer transitions 0/365 dead transitions.
[2024-06-20 19:46:34,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 365 transitions, 5758 flow
[2024-06-20 19:46:34,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 19:46:34,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 19:46:34,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 240 transitions.
[2024-06-20 19:46:34,702 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 19:46:34,702 INFO  L175             Difference]: Start difference. First operand has 182 places, 279 transitions, 4142 flow. Second operand 12 states and 240 transitions.
[2024-06-20 19:46:34,702 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 365 transitions, 5758 flow
[2024-06-20 19:46:35,338 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 365 transitions, 5460 flow, removed 114 selfloop flow, removed 6 redundant places.
[2024-06-20 19:46:35,343 INFO  L231             Difference]: Finished difference. Result has 189 places, 285 transitions, 4274 flow
[2024-06-20 19:46:35,343 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3848, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4274, PETRI_PLACES=189, PETRI_TRANSITIONS=285}
[2024-06-20 19:46:35,343 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places.
[2024-06-20 19:46:35,343 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 285 transitions, 4274 flow
[2024-06-20 19:46:35,343 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:35,343 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:35,343 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:35,344 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:46:35,344 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:35,344 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:35,344 INFO  L85        PathProgramCache]: Analyzing trace with hash -58244869, now seen corresponding path program 5 times
[2024-06-20 19:46:35,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:35,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406312736]
[2024-06-20 19:46:35,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:35,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:35,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:43,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-06-20 19:46:43,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:43,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406312736]
[2024-06-20 19:46:43,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406312736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:43,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:43,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:46:43,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875290962]
[2024-06-20 19:46:43,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:43,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:46:43,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:43,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:46:43,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:46:43,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:43,873 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 285 transitions, 4274 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:43,873 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:43,873 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:43,873 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:46,979 INFO  L124   PetriNetUnfolderBase]: 5978/9205 cut-off events.
[2024-06-20 19:46:46,979 INFO  L125   PetriNetUnfolderBase]: For 535778/535780 co-relation queries the response was YES.
[2024-06-20 19:46:47,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72874 conditions, 9205 events. 5978/9205 cut-off events. For 535778/535780 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 55662 event pairs, 2252 based on Foata normal form. 106/9311 useless extension candidates. Maximal degree in co-relation 72782. Up to 8347 conditions per place. 
[2024-06-20 19:46:47,065 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 273 selfloop transitions, 70 changer transitions 0/346 dead transitions.
[2024-06-20 19:46:47,065 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 346 transitions, 5461 flow
[2024-06-20 19:46:47,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:47,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:47,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 19:46:47,066 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-06-20 19:46:47,066 INFO  L175             Difference]: Start difference. First operand has 189 places, 285 transitions, 4274 flow. Second operand 9 states and 176 transitions.
[2024-06-20 19:46:47,066 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 346 transitions, 5461 flow
[2024-06-20 19:46:47,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 346 transitions, 5259 flow, removed 36 selfloop flow, removed 8 redundant places.
[2024-06-20 19:46:47,583 INFO  L231             Difference]: Finished difference. Result has 191 places, 293 transitions, 4424 flow
[2024-06-20 19:46:47,584 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4074, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4424, PETRI_PLACES=191, PETRI_TRANSITIONS=293}
[2024-06-20 19:46:47,584 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places.
[2024-06-20 19:46:47,584 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 293 transitions, 4424 flow
[2024-06-20 19:46:47,584 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:47,584 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:47,585 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:47,585 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:46:47,585 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:47,585 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:47,585 INFO  L85        PathProgramCache]: Analyzing trace with hash -666452479, now seen corresponding path program 6 times
[2024-06-20 19:46:47,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:47,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225891624]
[2024-06-20 19:46:47,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:47,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:47,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:55,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:55,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:55,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225891624]
[2024-06-20 19:46:55,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225891624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:55,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:55,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:46:55,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456099910]
[2024-06-20 19:46:55,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:55,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:46:55,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:55,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:46:55,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:46:55,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:55,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 293 transitions, 4424 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:55,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:55,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:55,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:58,896 INFO  L124   PetriNetUnfolderBase]: 6182/9565 cut-off events.
[2024-06-20 19:46:58,896 INFO  L125   PetriNetUnfolderBase]: For 545510/545512 co-relation queries the response was YES.
[2024-06-20 19:46:58,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75026 conditions, 9565 events. 6182/9565 cut-off events. For 545510/545512 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 58552 event pairs, 1907 based on Foata normal form. 74/9639 useless extension candidates. Maximal degree in co-relation 74931. Up to 7230 conditions per place. 
[2024-06-20 19:46:59,000 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 276 selfloop transitions, 80 changer transitions 0/359 dead transitions.
[2024-06-20 19:46:59,000 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 359 transitions, 5818 flow
[2024-06-20 19:46:59,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:59,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:59,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 19:46:59,003 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5083333333333333
[2024-06-20 19:46:59,003 INFO  L175             Difference]: Start difference. First operand has 191 places, 293 transitions, 4424 flow. Second operand 9 states and 183 transitions.
[2024-06-20 19:46:59,003 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 359 transitions, 5818 flow
[2024-06-20 19:46:59,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 359 transitions, 5621 flow, removed 58 selfloop flow, removed 5 redundant places.
[2024-06-20 19:46:59,767 INFO  L231             Difference]: Finished difference. Result has 196 places, 297 transitions, 4542 flow
[2024-06-20 19:46:59,767 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4227, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4542, PETRI_PLACES=196, PETRI_TRANSITIONS=297}
[2024-06-20 19:46:59,768 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 155 predicate places.
[2024-06-20 19:46:59,768 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 297 transitions, 4542 flow
[2024-06-20 19:46:59,768 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:46:59,768 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:59,768 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:59,768 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:46:59,768 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:59,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:59,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 1691064641, now seen corresponding path program 3 times
[2024-06-20 19:46:59,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:59,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559765435]
[2024-06-20 19:46:59,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:59,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:59,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:07,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:07,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:07,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559765435]
[2024-06-20 19:47:07,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559765435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:07,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:07,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:47:07,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809409460]
[2024-06-20 19:47:07,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:07,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:47:07,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:07,378 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:47:07,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:47:07,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:07,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 297 transitions, 4542 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:07,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:07,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:07,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:10,847 INFO  L124   PetriNetUnfolderBase]: 6349/9816 cut-off events.
[2024-06-20 19:47:10,847 INFO  L125   PetriNetUnfolderBase]: For 543939/543941 co-relation queries the response was YES.
[2024-06-20 19:47:10,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78158 conditions, 9816 events. 6349/9816 cut-off events. For 543939/543941 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 60746 event pairs, 2461 based on Foata normal form. 26/9842 useless extension candidates. Maximal degree in co-relation 78060. Up to 9516 conditions per place. 
[2024-06-20 19:47:10,943 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 306 selfloop transitions, 45 changer transitions 0/354 dead transitions.
[2024-06-20 19:47:10,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 354 transitions, 5785 flow
[2024-06-20 19:47:10,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:47:10,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:47:10,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-20 19:47:10,944 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-20 19:47:10,944 INFO  L175             Difference]: Start difference. First operand has 196 places, 297 transitions, 4542 flow. Second operand 9 states and 165 transitions.
[2024-06-20 19:47:10,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 354 transitions, 5785 flow
[2024-06-20 19:47:11,671 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 354 transitions, 5478 flow, removed 34 selfloop flow, removed 8 redundant places.
[2024-06-20 19:47:11,676 INFO  L231             Difference]: Finished difference. Result has 200 places, 313 transitions, 4683 flow
[2024-06-20 19:47:11,676 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4235, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4683, PETRI_PLACES=200, PETRI_TRANSITIONS=313}
[2024-06-20 19:47:11,676 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places.
[2024-06-20 19:47:11,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 313 transitions, 4683 flow
[2024-06-20 19:47:11,677 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:11,677 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:11,677 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:11,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:47:11,677 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:11,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:11,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 1691072081, now seen corresponding path program 4 times
[2024-06-20 19:47:11,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:11,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11031078]
[2024-06-20 19:47:11,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:11,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:11,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:19,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:19,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:19,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11031078]
[2024-06-20 19:47:19,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11031078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:19,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:19,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:47:19,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233683712]
[2024-06-20 19:47:19,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:19,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:47:19,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:19,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:47:19,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:47:19,346 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:19,347 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 313 transitions, 4683 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:19,347 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:19,347 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:19,347 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:22,322 INFO  L124   PetriNetUnfolderBase]: 6383/9871 cut-off events.
[2024-06-20 19:47:22,322 INFO  L125   PetriNetUnfolderBase]: For 570765/570767 co-relation queries the response was YES.
[2024-06-20 19:47:22,389 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80416 conditions, 9871 events. 6383/9871 cut-off events. For 570765/570767 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 61051 event pairs, 2490 based on Foata normal form. 6/9877 useless extension candidates. Maximal degree in co-relation 80315. Up to 9730 conditions per place. 
[2024-06-20 19:47:22,425 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 317 selfloop transitions, 24 changer transitions 0/344 dead transitions.
[2024-06-20 19:47:22,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 344 transitions, 5548 flow
[2024-06-20 19:47:22,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:47:22,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:47:22,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-20 19:47:22,427 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:47:22,428 INFO  L175             Difference]: Start difference. First operand has 200 places, 313 transitions, 4683 flow. Second operand 8 states and 128 transitions.
[2024-06-20 19:47:22,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 344 transitions, 5548 flow
[2024-06-20 19:47:23,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 344 transitions, 5323 flow, removed 98 selfloop flow, removed 3 redundant places.
[2024-06-20 19:47:23,124 INFO  L231             Difference]: Finished difference. Result has 206 places, 318 transitions, 4646 flow
[2024-06-20 19:47:23,124 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4484, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4646, PETRI_PLACES=206, PETRI_TRANSITIONS=318}
[2024-06-20 19:47:23,124 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places.
[2024-06-20 19:47:23,124 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 318 transitions, 4646 flow
[2024-06-20 19:47:23,124 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:23,125 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:23,125 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:23,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:47:23,125 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:23,125 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:23,125 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947565151, now seen corresponding path program 5 times
[2024-06-20 19:47:23,125 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:23,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247406268]
[2024-06-20 19:47:23,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:23,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:23,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:30,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:30,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:30,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247406268]
[2024-06-20 19:47:30,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247406268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:30,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:30,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:47:30,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175115624]
[2024-06-20 19:47:30,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:30,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:47:30,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:30,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:47:30,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:47:30,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:30,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 318 transitions, 4646 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:30,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:30,836 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:30,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:34,063 INFO  L124   PetriNetUnfolderBase]: 6494/10041 cut-off events.
[2024-06-20 19:47:34,063 INFO  L125   PetriNetUnfolderBase]: For 609488/609490 co-relation queries the response was YES.
[2024-06-20 19:47:34,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81316 conditions, 10041 events. 6494/10041 cut-off events. For 609488/609490 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 62230 event pairs, 2473 based on Foata normal form. 21/10062 useless extension candidates. Maximal degree in co-relation 81212. Up to 9608 conditions per place. 
[2024-06-20 19:47:34,177 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 301 selfloop transitions, 65 changer transitions 0/369 dead transitions.
[2024-06-20 19:47:34,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 369 transitions, 5933 flow
[2024-06-20 19:47:34,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:47:34,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:47:34,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-20 19:47:34,178 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-20 19:47:34,178 INFO  L175             Difference]: Start difference. First operand has 206 places, 318 transitions, 4646 flow. Second operand 9 states and 160 transitions.
[2024-06-20 19:47:34,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 369 transitions, 5933 flow
[2024-06-20 19:47:34,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 369 transitions, 5814 flow, removed 40 selfloop flow, removed 5 redundant places.
[2024-06-20 19:47:34,969 INFO  L231             Difference]: Finished difference. Result has 213 places, 332 transitions, 5054 flow
[2024-06-20 19:47:34,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4527, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5054, PETRI_PLACES=213, PETRI_TRANSITIONS=332}
[2024-06-20 19:47:34,970 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places.
[2024-06-20 19:47:34,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 332 transitions, 5054 flow
[2024-06-20 19:47:34,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:34,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:34,970 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:34,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:47:34,971 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:34,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:34,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947572591, now seen corresponding path program 6 times
[2024-06-20 19:47:34,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:34,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021840244]
[2024-06-20 19:47:34,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:34,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:35,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:42,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:42,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:42,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021840244]
[2024-06-20 19:47:42,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021840244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:42,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:42,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:47:42,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433234797]
[2024-06-20 19:47:42,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:42,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:47:42,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:42,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:47:42,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:47:42,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:42,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 332 transitions, 5054 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:42,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:42,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:42,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:45,809 INFO  L124   PetriNetUnfolderBase]: 6511/10068 cut-off events.
[2024-06-20 19:47:45,809 INFO  L125   PetriNetUnfolderBase]: For 651467/651469 co-relation queries the response was YES.
[2024-06-20 19:47:45,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84599 conditions, 10068 events. 6511/10068 cut-off events. For 651467/651469 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 62435 event pairs, 2507 based on Foata normal form. 6/10074 useless extension candidates. Maximal degree in co-relation 84491. Up to 9851 conditions per place. 
[2024-06-20 19:47:45,911 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 324 selfloop transitions, 34 changer transitions 0/361 dead transitions.
[2024-06-20 19:47:45,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 361 transitions, 5955 flow
[2024-06-20 19:47:45,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:47:45,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:47:45,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-20 19:47:45,913 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:47:45,913 INFO  L175             Difference]: Start difference. First operand has 213 places, 332 transitions, 5054 flow. Second operand 8 states and 128 transitions.
[2024-06-20 19:47:45,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 361 transitions, 5955 flow
[2024-06-20 19:47:46,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 361 transitions, 5714 flow, removed 115 selfloop flow, removed 2 redundant places.
[2024-06-20 19:47:46,927 INFO  L231             Difference]: Finished difference. Result has 220 places, 335 transitions, 5028 flow
[2024-06-20 19:47:46,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4843, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5028, PETRI_PLACES=220, PETRI_TRANSITIONS=335}
[2024-06-20 19:47:46,928 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places.
[2024-06-20 19:47:46,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 335 transitions, 5028 flow
[2024-06-20 19:47:46,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:46,929 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:46,929 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:46,929 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:47:46,929 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:46,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:46,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1956769361, now seen corresponding path program 7 times
[2024-06-20 19:47:46,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:46,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921068992]
[2024-06-20 19:47:46,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:46,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:46,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:53,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:53,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:53,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921068992]
[2024-06-20 19:47:53,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921068992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:53,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:53,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:47:53,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211001882]
[2024-06-20 19:47:53,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:53,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:47:53,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:53,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:47:53,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:47:53,735 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:53,735 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 335 transitions, 5028 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:53,735 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:53,735 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:53,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:56,939 INFO  L124   PetriNetUnfolderBase]: 6503/10056 cut-off events.
[2024-06-20 19:47:56,940 INFO  L125   PetriNetUnfolderBase]: For 610362/610364 co-relation queries the response was YES.
[2024-06-20 19:47:57,011 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82139 conditions, 10056 events. 6503/10056 cut-off events. For 610362/610364 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 62390 event pairs, 2493 based on Foata normal form. 6/10062 useless extension candidates. Maximal degree in co-relation 82028. Up to 9952 conditions per place. 
[2024-06-20 19:47:57,050 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 342 selfloop transitions, 18 changer transitions 0/363 dead transitions.
[2024-06-20 19:47:57,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 363 transitions, 5892 flow
[2024-06-20 19:47:57,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:47:57,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:47:57,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-20 19:47:57,052 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.390625
[2024-06-20 19:47:57,052 INFO  L175             Difference]: Start difference. First operand has 220 places, 335 transitions, 5028 flow. Second operand 8 states and 125 transitions.
[2024-06-20 19:47:57,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 363 transitions, 5892 flow
[2024-06-20 19:47:58,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 363 transitions, 5750 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-20 19:47:58,053 INFO  L231             Difference]: Finished difference. Result has 223 places, 337 transitions, 5013 flow
[2024-06-20 19:47:58,054 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4890, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5013, PETRI_PLACES=223, PETRI_TRANSITIONS=337}
[2024-06-20 19:47:58,054 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places.
[2024-06-20 19:47:58,054 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 337 transitions, 5013 flow
[2024-06-20 19:47:58,054 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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-06-20 19:47:58,054 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:58,054 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:58,054 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:47:58,054 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:58,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:58,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -1292054483, now seen corresponding path program 1 times
[2024-06-20 19:47:58,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:58,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22030786]
[2024-06-20 19:47:58,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:58,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:58,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:06,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:06,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:06,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22030786]
[2024-06-20 19:48:06,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22030786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:06,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:06,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:06,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102222755]
[2024-06-20 19:48:06,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:06,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:06,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:06,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:06,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:06,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:06,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 337 transitions, 5013 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:06,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:06,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:06,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:09,848 INFO  L124   PetriNetUnfolderBase]: 6497/10048 cut-off events.
[2024-06-20 19:48:09,849 INFO  L125   PetriNetUnfolderBase]: For 604129/604131 co-relation queries the response was YES.
[2024-06-20 19:48:09,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81666 conditions, 10048 events. 6497/10048 cut-off events. For 604129/604131 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 62415 event pairs, 2511 based on Foata normal form. 4/10052 useless extension candidates. Maximal degree in co-relation 81554. Up to 9986 conditions per place. 
[2024-06-20 19:48:09,960 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 336 selfloop transitions, 22 changer transitions 0/361 dead transitions.
[2024-06-20 19:48:09,960 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 361 transitions, 5925 flow
[2024-06-20 19:48:09,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:48:09,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:48:09,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-20 19:48:09,961 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:48:09,961 INFO  L175             Difference]: Start difference. First operand has 223 places, 337 transitions, 5013 flow. Second operand 6 states and 96 transitions.
[2024-06-20 19:48:09,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 361 transitions, 5925 flow
[2024-06-20 19:48:10,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 361 transitions, 5820 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-20 19:48:10,916 INFO  L231             Difference]: Finished difference. Result has 225 places, 346 transitions, 5145 flow
[2024-06-20 19:48:10,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4908, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5145, PETRI_PLACES=225, PETRI_TRANSITIONS=346}
[2024-06-20 19:48:10,918 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places.
[2024-06-20 19:48:10,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 346 transitions, 5145 flow
[2024-06-20 19:48:10,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:10,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:10,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:10,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:48:10,919 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:10,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:10,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -226906715, now seen corresponding path program 1 times
[2024-06-20 19:48:10,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:10,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467072590]
[2024-06-20 19:48:10,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:10,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:10,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:21,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:21,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:21,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467072590]
[2024-06-20 19:48:21,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467072590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:21,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:21,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:21,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453295743]
[2024-06-20 19:48:21,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:21,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:21,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:21,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:21,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:22,055 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:48:22,055 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 346 transitions, 5145 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:22,055 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:22,055 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:48:22,055 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:24,936 INFO  L124   PetriNetUnfolderBase]: 6333/9842 cut-off events.
[2024-06-20 19:48:24,936 INFO  L125   PetriNetUnfolderBase]: For 627031/627117 co-relation queries the response was YES.
[2024-06-20 19:48:25,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81236 conditions, 9842 events. 6333/9842 cut-off events. For 627031/627117 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 61347 event pairs, 2467 based on Foata normal form. 40/9851 useless extension candidates. Maximal degree in co-relation 81121. Up to 9688 conditions per place. 
[2024-06-20 19:48:25,049 INFO  L140   encePairwiseOnDemand]: 34/40 looper letters, 320 selfloop transitions, 16 changer transitions 0/357 dead transitions.
[2024-06-20 19:48:25,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 357 transitions, 5871 flow
[2024-06-20 19:48:25,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:48:25,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:48:25,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions.
[2024-06-20 19:48:25,050 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42
[2024-06-20 19:48:25,050 INFO  L175             Difference]: Start difference. First operand has 225 places, 346 transitions, 5145 flow. Second operand 5 states and 84 transitions.
[2024-06-20 19:48:25,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 357 transitions, 5871 flow
[2024-06-20 19:48:25,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 357 transitions, 5794 flow, removed 29 selfloop flow, removed 2 redundant places.
[2024-06-20 19:48:25,975 INFO  L231             Difference]: Finished difference. Result has 228 places, 348 transitions, 5141 flow
[2024-06-20 19:48:25,975 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5068, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5141, PETRI_PLACES=228, PETRI_TRANSITIONS=348}
[2024-06-20 19:48:25,976 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places.
[2024-06-20 19:48:25,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 348 transitions, 5141 flow
[2024-06-20 19:48:25,976 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:25,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:25,976 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:25,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:48:25,976 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:25,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:25,977 INFO  L85        PathProgramCache]: Analyzing trace with hash 938751278, now seen corresponding path program 1 times
[2024-06-20 19:48:25,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:25,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565498800]
[2024-06-20 19:48:25,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:25,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:26,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:35,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:35,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:35,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565498800]
[2024-06-20 19:48:35,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565498800] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:35,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:35,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:35,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829069501]
[2024-06-20 19:48:35,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:35,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:35,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:35,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:35,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:35,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:35,320 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 348 transitions, 5141 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:35,320 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:35,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:35,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:38,380 INFO  L124   PetriNetUnfolderBase]: 6484/10029 cut-off events.
[2024-06-20 19:48:38,380 INFO  L125   PetriNetUnfolderBase]: For 640106/640106 co-relation queries the response was YES.
[2024-06-20 19:48:38,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82806 conditions, 10029 events. 6484/10029 cut-off events. For 640106/640106 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 62184 event pairs, 2495 based on Foata normal form. 1/10030 useless extension candidates. Maximal degree in co-relation 82689. Up to 9934 conditions per place. 
[2024-06-20 19:48:38,493 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 361 selfloop transitions, 23 changer transitions 0/387 dead transitions.
[2024-06-20 19:48:38,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 387 transitions, 6156 flow
[2024-06-20 19:48:38,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:48:38,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:48:38,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-20 19:48:38,494 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 19:48:38,495 INFO  L175             Difference]: Start difference. First operand has 228 places, 348 transitions, 5141 flow. Second operand 8 states and 136 transitions.
[2024-06-20 19:48:38,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 387 transitions, 6156 flow
[2024-06-20 19:48:39,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 387 transitions, 6099 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-20 19:48:39,484 INFO  L231             Difference]: Finished difference. Result has 233 places, 351 transitions, 5194 flow
[2024-06-20 19:48:39,484 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5084, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5194, PETRI_PLACES=233, PETRI_TRANSITIONS=351}
[2024-06-20 19:48:39,485 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places.
[2024-06-20 19:48:39,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 351 transitions, 5194 flow
[2024-06-20 19:48:39,485 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:39,485 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:39,485 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:39,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:48:39,485 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:39,486 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:39,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693914750, now seen corresponding path program 1 times
[2024-06-20 19:48:39,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:39,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678365311]
[2024-06-20 19:48:39,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:39,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:39,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:47,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:47,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:47,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678365311]
[2024-06-20 19:48:47,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678365311] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:47,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:47,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:48:47,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573017381]
[2024-06-20 19:48:47,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:47,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:48:47,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:47,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:48:47,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:48:47,571 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:47,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 351 transitions, 5194 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:47,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:47,572 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:47,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:50,862 INFO  L124   PetriNetUnfolderBase]: 6464/9997 cut-off events.
[2024-06-20 19:48:50,862 INFO  L125   PetriNetUnfolderBase]: For 660483/660483 co-relation queries the response was YES.
[2024-06-20 19:48:50,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83207 conditions, 9997 events. 6464/9997 cut-off events. For 660483/660483 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 62047 event pairs, 2367 based on Foata normal form. 12/10009 useless extension candidates. Maximal degree in co-relation 83089. Up to 9650 conditions per place. 
[2024-06-20 19:48:50,972 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 345 selfloop transitions, 50 changer transitions 0/398 dead transitions.
[2024-06-20 19:48:50,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 398 transitions, 6146 flow
[2024-06-20 19:48:50,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:48:50,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:48:50,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions.
[2024-06-20 19:48:50,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42
[2024-06-20 19:48:50,974 INFO  L175             Difference]: Start difference. First operand has 233 places, 351 transitions, 5194 flow. Second operand 10 states and 168 transitions.
[2024-06-20 19:48:50,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 398 transitions, 6146 flow
[2024-06-20 19:48:51,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 398 transitions, 6070 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-20 19:48:51,987 INFO  L231             Difference]: Finished difference. Result has 240 places, 353 transitions, 5256 flow
[2024-06-20 19:48:51,987 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5119, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5256, PETRI_PLACES=240, PETRI_TRANSITIONS=353}
[2024-06-20 19:48:51,987 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places.
[2024-06-20 19:48:51,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 353 transitions, 5256 flow
[2024-06-20 19:48:51,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:51,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:51,987 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:51,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:48:51,988 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:51,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:51,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 992069314, now seen corresponding path program 2 times
[2024-06-20 19:48:51,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:51,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905210185]
[2024-06-20 19:48:51,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:51,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:52,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:59,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:59,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:59,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905210185]
[2024-06-20 19:48:59,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905210185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:59,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:59,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:48:59,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112319339]
[2024-06-20 19:48:59,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:59,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:48:59,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:59,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:48:59,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:49:00,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:00,089 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 353 transitions, 5256 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:00,089 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:00,089 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:00,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:03,338 INFO  L124   PetriNetUnfolderBase]: 6485/10037 cut-off events.
[2024-06-20 19:49:03,339 INFO  L125   PetriNetUnfolderBase]: For 687540/687542 co-relation queries the response was YES.
[2024-06-20 19:49:03,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83631 conditions, 10037 events. 6485/10037 cut-off events. For 687540/687542 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 62404 event pairs, 2399 based on Foata normal form. 26/10063 useless extension candidates. Maximal degree in co-relation 83511. Up to 9661 conditions per place. 
[2024-06-20 19:49:03,456 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 356 selfloop transitions, 42 changer transitions 0/401 dead transitions.
[2024-06-20 19:49:03,456 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 401 transitions, 6259 flow
[2024-06-20 19:49:03,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:49:03,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:49:03,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-20 19:49:03,458 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175
[2024-06-20 19:49:03,459 INFO  L175             Difference]: Start difference. First operand has 240 places, 353 transitions, 5256 flow. Second operand 10 states and 167 transitions.
[2024-06-20 19:49:03,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 401 transitions, 6259 flow
[2024-06-20 19:49:04,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 401 transitions, 6128 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-20 19:49:04,839 INFO  L231             Difference]: Finished difference. Result has 244 places, 356 transitions, 5299 flow
[2024-06-20 19:49:04,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5125, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5299, PETRI_PLACES=244, PETRI_TRANSITIONS=356}
[2024-06-20 19:49:04,840 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 203 predicate places.
[2024-06-20 19:49:04,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 356 transitions, 5299 flow
[2024-06-20 19:49:04,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:04,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:04,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:04,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:49:04,840 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:04,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:04,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1628215936, now seen corresponding path program 3 times
[2024-06-20 19:49:04,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:04,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740499184]
[2024-06-20 19:49:04,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:04,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:04,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:13,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:13,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:13,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740499184]
[2024-06-20 19:49:13,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740499184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:13,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:13,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:49:13,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853252114]
[2024-06-20 19:49:13,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:13,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:49:13,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:13,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:49:13,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:49:13,312 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:13,313 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 356 transitions, 5299 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:13,313 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:13,313 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:13,313 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:16,607 INFO  L124   PetriNetUnfolderBase]: 6526/10108 cut-off events.
[2024-06-20 19:49:16,607 INFO  L125   PetriNetUnfolderBase]: For 701676/701678 co-relation queries the response was YES.
[2024-06-20 19:49:16,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84487 conditions, 10108 events. 6526/10108 cut-off events. For 701676/701678 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 63048 event pairs, 2412 based on Foata normal form. 14/10122 useless extension candidates. Maximal degree in co-relation 84365. Up to 9760 conditions per place. 
[2024-06-20 19:49:16,735 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 361 selfloop transitions, 45 changer transitions 0/409 dead transitions.
[2024-06-20 19:49:16,735 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 409 transitions, 6326 flow
[2024-06-20 19:49:16,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:49:16,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:49:16,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions.
[2024-06-20 19:49:16,737 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41363636363636364
[2024-06-20 19:49:16,738 INFO  L175             Difference]: Start difference. First operand has 244 places, 356 transitions, 5299 flow. Second operand 11 states and 182 transitions.
[2024-06-20 19:49:16,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 409 transitions, 6326 flow
[2024-06-20 19:49:17,955 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 409 transitions, 6147 flow, removed 36 selfloop flow, removed 8 redundant places.
[2024-06-20 19:49:17,960 INFO  L231             Difference]: Finished difference. Result has 249 places, 359 transitions, 5300 flow
[2024-06-20 19:49:17,960 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5121, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5300, PETRI_PLACES=249, PETRI_TRANSITIONS=359}
[2024-06-20 19:49:17,960 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 208 predicate places.
[2024-06-20 19:49:17,961 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 359 transitions, 5300 flow
[2024-06-20 19:49:17,961 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:17,961 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:17,961 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:17,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:49:17,961 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:17,961 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:17,961 INFO  L85        PathProgramCache]: Analyzing trace with hash 883397630, now seen corresponding path program 4 times
[2024-06-20 19:49:17,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:17,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067034960]
[2024-06-20 19:49:17,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:17,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:18,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:26,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:26,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:26,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067034960]
[2024-06-20 19:49:26,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067034960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:26,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:26,795 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:49:26,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795110413]
[2024-06-20 19:49:26,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:26,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:49:26,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:26,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:49:26,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:49:27,104 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:27,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 359 transitions, 5300 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:27,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:27,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:27,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:30,617 INFO  L124   PetriNetUnfolderBase]: 6738/10476 cut-off events.
[2024-06-20 19:49:30,617 INFO  L125   PetriNetUnfolderBase]: For 783783/783785 co-relation queries the response was YES.
[2024-06-20 19:49:30,702 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86620 conditions, 10476 events. 6738/10476 cut-off events. For 783783/783785 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 66089 event pairs, 2467 based on Foata normal form. 56/10532 useless extension candidates. Maximal degree in co-relation 86496. Up to 9785 conditions per place. 
[2024-06-20 19:49:30,743 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 353 selfloop transitions, 57 changer transitions 0/413 dead transitions.
[2024-06-20 19:49:30,743 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 413 transitions, 6570 flow
[2024-06-20 19:49:30,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:49:30,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:49:30,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-20 19:49:30,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625
[2024-06-20 19:49:30,745 INFO  L175             Difference]: Start difference. First operand has 249 places, 359 transitions, 5300 flow. Second operand 10 states and 185 transitions.
[2024-06-20 19:49:30,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 413 transitions, 6570 flow
[2024-06-20 19:49:32,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 413 transitions, 6436 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-20 19:49:32,061 INFO  L231             Difference]: Finished difference. Result has 252 places, 361 transitions, 5372 flow
[2024-06-20 19:49:32,061 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5166, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5372, PETRI_PLACES=252, PETRI_TRANSITIONS=361}
[2024-06-20 19:49:32,061 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places.
[2024-06-20 19:49:32,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 361 transitions, 5372 flow
[2024-06-20 19:49:32,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:32,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:32,061 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:32,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:49:32,062 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:32,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:32,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 530309358, now seen corresponding path program 5 times
[2024-06-20 19:49:32,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:32,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286507741]
[2024-06-20 19:49:32,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:32,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:32,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:40,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:40,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:40,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286507741]
[2024-06-20 19:49:40,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286507741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:40,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:40,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:49:40,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610262694]
[2024-06-20 19:49:40,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:40,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:49:40,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:40,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:49:40,234 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:49:40,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:40,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 361 transitions, 5372 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:40,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:40,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:40,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:43,936 INFO  L124   PetriNetUnfolderBase]: 6779/10547 cut-off events.
[2024-06-20 19:49:43,937 INFO  L125   PetriNetUnfolderBase]: For 754363/754365 co-relation queries the response was YES.
[2024-06-20 19:49:44,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87536 conditions, 10547 events. 6779/10547 cut-off events. For 754363/754365 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 66614 event pairs, 2625 based on Foata normal form. 14/10561 useless extension candidates. Maximal degree in co-relation 87411. Up to 10374 conditions per place. 
[2024-06-20 19:49:44,060 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 373 selfloop transitions, 19 changer transitions 0/395 dead transitions.
[2024-06-20 19:49:44,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 395 transitions, 6296 flow
[2024-06-20 19:49:44,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:49:44,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:49:44,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions.
[2024-06-20 19:49:44,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-20 19:49:44,062 INFO  L175             Difference]: Start difference. First operand has 252 places, 361 transitions, 5372 flow. Second operand 9 states and 140 transitions.
[2024-06-20 19:49:44,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 395 transitions, 6296 flow
[2024-06-20 19:49:45,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 395 transitions, 6132 flow, removed 27 selfloop flow, removed 8 redundant places.
[2024-06-20 19:49:45,458 INFO  L231             Difference]: Finished difference. Result has 253 places, 362 transitions, 5302 flow
[2024-06-20 19:49:45,458 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5208, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5302, PETRI_PLACES=253, PETRI_TRANSITIONS=362}
[2024-06-20 19:49:45,459 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places.
[2024-06-20 19:49:45,459 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 362 transitions, 5302 flow
[2024-06-20 19:49:45,459 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:45,459 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:45,459 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:45,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:49:45,459 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:45,459 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:45,459 INFO  L85        PathProgramCache]: Analyzing trace with hash 883628270, now seen corresponding path program 6 times
[2024-06-20 19:49:45,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:45,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791871265]
[2024-06-20 19:49:45,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:45,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:45,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:53,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:53,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:53,767 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791871265]
[2024-06-20 19:49:53,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791871265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:53,767 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:53,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:49:53,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210058586]
[2024-06-20 19:49:53,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:53,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:49:53,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:53,768 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:49:53,768 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:49:53,926 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:53,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 362 transitions, 5302 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:53,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:53,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:53,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:57,477 INFO  L124   PetriNetUnfolderBase]: 6995/10894 cut-off events.
[2024-06-20 19:49:57,477 INFO  L125   PetriNetUnfolderBase]: For 779478/779480 co-relation queries the response was YES.
[2024-06-20 19:49:57,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89446 conditions, 10894 events. 6995/10894 cut-off events. For 779478/779480 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 69178 event pairs, 2647 based on Foata normal form. 12/10906 useless extension candidates. Maximal degree in co-relation 89320. Up to 10344 conditions per place. 
[2024-06-20 19:49:57,600 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 356 selfloop transitions, 57 changer transitions 0/416 dead transitions.
[2024-06-20 19:49:57,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 416 transitions, 6544 flow
[2024-06-20 19:49:57,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:57,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:57,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-20 19:49:57,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.421875
[2024-06-20 19:49:57,602 INFO  L175             Difference]: Start difference. First operand has 253 places, 362 transitions, 5302 flow. Second operand 8 states and 135 transitions.
[2024-06-20 19:49:57,602 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 416 transitions, 6544 flow
[2024-06-20 19:49:58,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 416 transitions, 6466 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-20 19:49:58,726 INFO  L231             Difference]: Finished difference. Result has 257 places, 383 transitions, 5756 flow
[2024-06-20 19:49:58,726 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5224, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5756, PETRI_PLACES=257, PETRI_TRANSITIONS=383}
[2024-06-20 19:49:58,726 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places.
[2024-06-20 19:49:58,726 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 383 transitions, 5756 flow
[2024-06-20 19:49:58,726 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:58,726 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:58,726 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:58,727 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:49:58,727 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:58,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:58,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 244978848, now seen corresponding path program 7 times
[2024-06-20 19:49:58,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:58,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756617488]
[2024-06-20 19:49:58,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:58,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:58,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:07,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:07,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:07,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756617488]
[2024-06-20 19:50:07,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756617488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:07,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:07,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:50:07,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763875005]
[2024-06-20 19:50:07,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:07,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:50:07,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:07,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:50:07,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:50:07,584 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:07,584 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 383 transitions, 5756 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:07,584 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:07,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:07,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:11,141 INFO  L124   PetriNetUnfolderBase]: 6975/10861 cut-off events.
[2024-06-20 19:50:11,141 INFO  L125   PetriNetUnfolderBase]: For 788161/788163 co-relation queries the response was YES.
[2024-06-20 19:50:11,227 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89497 conditions, 10861 events. 6975/10861 cut-off events. For 788161/788163 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 68893 event pairs, 2645 based on Foata normal form. 14/10875 useless extension candidates. Maximal degree in co-relation 89367. Up to 10588 conditions per place. 
[2024-06-20 19:50:11,266 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 382 selfloop transitions, 30 changer transitions 0/415 dead transitions.
[2024-06-20 19:50:11,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 415 transitions, 6584 flow
[2024-06-20 19:50:11,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:50:11,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:50:11,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-20 19:50:11,268 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39166666666666666
[2024-06-20 19:50:11,268 INFO  L175             Difference]: Start difference. First operand has 257 places, 383 transitions, 5756 flow. Second operand 9 states and 141 transitions.
[2024-06-20 19:50:11,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 415 transitions, 6584 flow
[2024-06-20 19:50:12,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 415 transitions, 6448 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-20 19:50:12,595 INFO  L231             Difference]: Finished difference. Result has 259 places, 382 transitions, 5594 flow
[2024-06-20 19:50:12,595 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5528, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5594, PETRI_PLACES=259, PETRI_TRANSITIONS=382}
[2024-06-20 19:50:12,595 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places.
[2024-06-20 19:50:12,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 382 transitions, 5594 flow
[2024-06-20 19:50:12,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:12,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:12,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:12,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:50:12,596 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:12,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:12,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1398981717, now seen corresponding path program 1 times
[2024-06-20 19:50:12,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:12,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990343659]
[2024-06-20 19:50:12,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:12,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:12,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:23,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:23,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:23,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990343659]
[2024-06-20 19:50:23,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990343659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:23,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:23,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:23,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100516800]
[2024-06-20 19:50:23,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:23,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:23,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:23,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:23,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:23,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:23,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 382 transitions, 5594 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:23,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:23,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:23,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:26,756 INFO  L124   PetriNetUnfolderBase]: 6995/10889 cut-off events.
[2024-06-20 19:50:26,756 INFO  L125   PetriNetUnfolderBase]: For 704399/704401 co-relation queries the response was YES.
[2024-06-20 19:50:26,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87748 conditions, 10889 events. 6995/10889 cut-off events. For 704399/704401 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 69143 event pairs, 2688 based on Foata normal form. 6/10895 useless extension candidates. Maximal degree in co-relation 87620. Up to 10751 conditions per place. 
[2024-06-20 19:50:26,882 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 366 selfloop transitions, 39 changer transitions 0/408 dead transitions.
[2024-06-20 19:50:26,882 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 408 transitions, 6700 flow
[2024-06-20 19:50:26,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:50:26,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:50:26,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:50:26,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:50:26,884 INFO  L175             Difference]: Start difference. First operand has 259 places, 382 transitions, 5594 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:50:26,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 408 transitions, 6700 flow
[2024-06-20 19:50:28,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 408 transitions, 6590 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-20 19:50:28,300 INFO  L231             Difference]: Finished difference. Result has 259 places, 388 transitions, 5690 flow
[2024-06-20 19:50:28,300 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5484, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5690, PETRI_PLACES=259, PETRI_TRANSITIONS=388}
[2024-06-20 19:50:28,300 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places.
[2024-06-20 19:50:28,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 388 transitions, 5690 flow
[2024-06-20 19:50:28,301 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:28,301 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:28,301 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:28,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:50:28,301 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:28,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:28,301 INFO  L85        PathProgramCache]: Analyzing trace with hash -793782357, now seen corresponding path program 2 times
[2024-06-20 19:50:28,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:28,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858164010]
[2024-06-20 19:50:28,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:28,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:28,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:39,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-06-20 19:50:39,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:39,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858164010]
[2024-06-20 19:50:39,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858164010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:39,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:39,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:39,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771135968]
[2024-06-20 19:50:39,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:39,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:39,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:39,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:39,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:39,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:39,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 388 transitions, 5690 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:39,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:39,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:39,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:42,751 INFO  L124   PetriNetUnfolderBase]: 6983/10873 cut-off events.
[2024-06-20 19:50:42,751 INFO  L125   PetriNetUnfolderBase]: For 726271/726273 co-relation queries the response was YES.
[2024-06-20 19:50:42,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88512 conditions, 10873 events. 6983/10873 cut-off events. For 726271/726273 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 68955 event pairs, 2684 based on Foata normal form. 6/10879 useless extension candidates. Maximal degree in co-relation 88383. Up to 10767 conditions per place. 
[2024-06-20 19:50:42,873 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 366 selfloop transitions, 35 changer transitions 0/404 dead transitions.
[2024-06-20 19:50:42,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 404 transitions, 6550 flow
[2024-06-20 19:50:42,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:50:42,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:50:42,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-20 19:50:42,875 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:50:42,875 INFO  L175             Difference]: Start difference. First operand has 259 places, 388 transitions, 5690 flow. Second operand 6 states and 100 transitions.
[2024-06-20 19:50:42,875 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 404 transitions, 6550 flow
[2024-06-20 19:50:44,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 404 transitions, 6442 flow, removed 44 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:44,137 INFO  L231             Difference]: Finished difference. Result has 262 places, 388 transitions, 5659 flow
[2024-06-20 19:50:44,137 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5582, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5659, PETRI_PLACES=262, PETRI_TRANSITIONS=388}
[2024-06-20 19:50:44,137 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places.
[2024-06-20 19:50:44,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 388 transitions, 5659 flow
[2024-06-20 19:50:44,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:44,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:44,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:44,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:50:44,138 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:44,138 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:44,138 INFO  L85        PathProgramCache]: Analyzing trace with hash -87325778, now seen corresponding path program 1 times
[2024-06-20 19:50:44,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:44,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909835763]
[2024-06-20 19:50:44,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:44,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:44,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:53,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:53,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:53,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909835763]
[2024-06-20 19:50:53,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909835763] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:53,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:53,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:53,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813469959]
[2024-06-20 19:50:53,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:53,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:53,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:53,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:53,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:53,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:53,372 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 388 transitions, 5659 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:53,372 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:53,372 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:53,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:56,890 INFO  L124   PetriNetUnfolderBase]: 6991/10884 cut-off events.
[2024-06-20 19:50:56,890 INFO  L125   PetriNetUnfolderBase]: For 747100/747100 co-relation queries the response was YES.
[2024-06-20 19:50:56,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88982 conditions, 10884 events. 6991/10884 cut-off events. For 747100/747100 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 68861 event pairs, 2557 based on Foata normal form. 2/10886 useless extension candidates. Maximal degree in co-relation 88851. Up to 10742 conditions per place. 
[2024-06-20 19:50:57,020 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 401 selfloop transitions, 44 changer transitions 2/450 dead transitions.
[2024-06-20 19:50:57,020 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 450 transitions, 7179 flow
[2024-06-20 19:50:57,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:50:57,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:50:57,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:50:57,022 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:50:57,022 INFO  L175             Difference]: Start difference. First operand has 262 places, 388 transitions, 5659 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:50:57,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 450 transitions, 7179 flow
[2024-06-20 19:50:58,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 450 transitions, 7075 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-20 19:50:58,144 INFO  L231             Difference]: Finished difference. Result has 271 places, 410 transitions, 6099 flow
[2024-06-20 19:50:58,145 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5555, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6099, PETRI_PLACES=271, PETRI_TRANSITIONS=410}
[2024-06-20 19:50:58,145 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 230 predicate places.
[2024-06-20 19:50:58,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 410 transitions, 6099 flow
[2024-06-20 19:50:58,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:58,145 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:58,145 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:58,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:50:58,145 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:58,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:58,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -87086768, now seen corresponding path program 2 times
[2024-06-20 19:50:58,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:58,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323389024]
[2024-06-20 19:50:58,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:58,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:58,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:08,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:08,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:08,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323389024]
[2024-06-20 19:51:08,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323389024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:08,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:08,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:08,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305367567]
[2024-06-20 19:51:08,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:08,569 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:08,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:08,570 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:08,570 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:08,769 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:08,770 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 410 transitions, 6099 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:08,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:08,770 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:08,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:12,399 INFO  L124   PetriNetUnfolderBase]: 6870/10697 cut-off events.
[2024-06-20 19:51:12,399 INFO  L125   PetriNetUnfolderBase]: For 767115/767115 co-relation queries the response was YES.
[2024-06-20 19:51:12,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88493 conditions, 10697 events. 6870/10697 cut-off events. For 767115/767115 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 67680 event pairs, 2588 based on Foata normal form. 2/10699 useless extension candidates. Maximal degree in co-relation 88356. Up to 10535 conditions per place. 
[2024-06-20 19:51:12,527 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 385 selfloop transitions, 58 changer transitions 0/446 dead transitions.
[2024-06-20 19:51:12,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 446 transitions, 7120 flow
[2024-06-20 19:51:12,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:12,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:12,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 19:51:12,528 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 19:51:12,528 INFO  L175             Difference]: Start difference. First operand has 271 places, 410 transitions, 6099 flow. Second operand 9 states and 149 transitions.
[2024-06-20 19:51:12,528 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 446 transitions, 7120 flow
[2024-06-20 19:51:14,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 446 transitions, 6940 flow, removed 89 selfloop flow, removed 1 redundant places.
[2024-06-20 19:51:14,177 INFO  L231             Difference]: Finished difference. Result has 279 places, 410 transitions, 6040 flow
[2024-06-20 19:51:14,177 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5919, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6040, PETRI_PLACES=279, PETRI_TRANSITIONS=410}
[2024-06-20 19:51:14,178 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places.
[2024-06-20 19:51:14,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 410 transitions, 6040 flow
[2024-06-20 19:51:14,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:14,178 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:14,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:14,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:51:14,179 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:14,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:14,179 INFO  L85        PathProgramCache]: Analyzing trace with hash -87086458, now seen corresponding path program 1 times
[2024-06-20 19:51:14,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:14,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119142176]
[2024-06-20 19:51:14,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:14,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:14,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:24,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:24,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:24,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119142176]
[2024-06-20 19:51:24,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119142176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:24,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:24,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:24,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963324580]
[2024-06-20 19:51:24,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:24,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:24,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:24,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:24,704 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:24,839 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:24,840 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 410 transitions, 6040 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:24,840 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:24,840 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:24,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:28,457 INFO  L124   PetriNetUnfolderBase]: 6880/10711 cut-off events.
[2024-06-20 19:51:28,457 INFO  L125   PetriNetUnfolderBase]: For 793113/793113 co-relation queries the response was YES.
[2024-06-20 19:51:28,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88874 conditions, 10711 events. 6880/10711 cut-off events. For 793113/793113 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 67713 event pairs, 2590 based on Foata normal form. 2/10713 useless extension candidates. Maximal degree in co-relation 88734. Up to 10525 conditions per place. 
[2024-06-20 19:51:28,588 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 391 selfloop transitions, 68 changer transitions 0/462 dead transitions.
[2024-06-20 19:51:28,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 462 transitions, 7582 flow
[2024-06-20 19:51:28,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:28,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:28,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 19:51:28,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 19:51:28,591 INFO  L175             Difference]: Start difference. First operand has 279 places, 410 transitions, 6040 flow. Second operand 9 states and 153 transitions.
[2024-06-20 19:51:28,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 462 transitions, 7582 flow
[2024-06-20 19:51:30,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 462 transitions, 7461 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 19:51:30,144 INFO  L231             Difference]: Finished difference. Result has 284 places, 424 transitions, 6385 flow
[2024-06-20 19:51:30,144 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5919, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6385, PETRI_PLACES=284, PETRI_TRANSITIONS=424}
[2024-06-20 19:51:30,145 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 243 predicate places.
[2024-06-20 19:51:30,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 424 transitions, 6385 flow
[2024-06-20 19:51:30,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:30,145 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:30,145 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:30,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 19:51:30,145 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:30,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:30,145 INFO  L85        PathProgramCache]: Analyzing trace with hash -955147992, now seen corresponding path program 2 times
[2024-06-20 19:51:30,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:30,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738363096]
[2024-06-20 19:51:30,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:30,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:30,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:41,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:41,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:41,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738363096]
[2024-06-20 19:51:41,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738363096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:41,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:41,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:41,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244873508]
[2024-06-20 19:51:41,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:41,120 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:41,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:41,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:41,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:41,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:41,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 424 transitions, 6385 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:41,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:41,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:41,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:44,969 INFO  L124   PetriNetUnfolderBase]: 6914/10761 cut-off events.
[2024-06-20 19:51:44,970 INFO  L125   PetriNetUnfolderBase]: For 827607/827607 co-relation queries the response was YES.
[2024-06-20 19:51:45,064 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91066 conditions, 10761 events. 6914/10761 cut-off events. For 827607/827607 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 68073 event pairs, 2589 based on Foata normal form. 2/10763 useless extension candidates. Maximal degree in co-relation 90922. Up to 10629 conditions per place. 
[2024-06-20 19:51:45,106 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 415 selfloop transitions, 50 changer transitions 0/468 dead transitions.
[2024-06-20 19:51:45,106 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 468 transitions, 7723 flow
[2024-06-20 19:51:45,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:45,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:45,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-20 19:51:45,107 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:51:45,107 INFO  L175             Difference]: Start difference. First operand has 284 places, 424 transitions, 6385 flow. Second operand 9 states and 144 transitions.
[2024-06-20 19:51:45,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 468 transitions, 7723 flow
[2024-06-20 19:51:47,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 468 transitions, 7633 flow, removed 42 selfloop flow, removed 2 redundant places.
[2024-06-20 19:51:47,115 INFO  L231             Difference]: Finished difference. Result has 293 places, 437 transitions, 6720 flow
[2024-06-20 19:51:47,115 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6303, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6720, PETRI_PLACES=293, PETRI_TRANSITIONS=437}
[2024-06-20 19:51:47,116 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 252 predicate places.
[2024-06-20 19:51:47,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 293 places, 437 transitions, 6720 flow
[2024-06-20 19:51:47,116 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:47,116 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:47,116 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:47,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 19:51:47,116 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:47,116 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:47,116 INFO  L85        PathProgramCache]: Analyzing trace with hash -845389330, now seen corresponding path program 1 times
[2024-06-20 19:51:47,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:47,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171156936]
[2024-06-20 19:51:47,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:47,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:47,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:55,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:55,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:55,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171156936]
[2024-06-20 19:51:55,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171156936] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:55,804 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:55,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:51:55,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062904781]
[2024-06-20 19:51:55,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:55,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:51:55,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:55,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:51:55,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:51:55,958 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:55,958 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 437 transitions, 6720 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:55,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:55,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:55,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:59,532 INFO  L124   PetriNetUnfolderBase]: 6955/10820 cut-off events.
[2024-06-20 19:51:59,532 INFO  L125   PetriNetUnfolderBase]: For 858658/858660 co-relation queries the response was YES.
[2024-06-20 19:51:59,640 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92269 conditions, 10820 events. 6955/10820 cut-off events. For 858658/858660 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 68432 event pairs, 2583 based on Foata normal form. 2/10822 useless extension candidates. Maximal degree in co-relation 92120. Up to 10576 conditions per place. 
[2024-06-20 19:51:59,683 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 424 selfloop transitions, 69 changer transitions 0/496 dead transitions.
[2024-06-20 19:51:59,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 496 transitions, 8542 flow
[2024-06-20 19:51:59,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:59,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:59,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-20 19:51:59,685 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.421875
[2024-06-20 19:51:59,685 INFO  L175             Difference]: Start difference. First operand has 293 places, 437 transitions, 6720 flow. Second operand 8 states and 135 transitions.
[2024-06-20 19:51:59,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 496 transitions, 8542 flow
[2024-06-20 19:52:01,691 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 496 transitions, 8400 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-06-20 19:52:01,697 INFO  L231             Difference]: Finished difference. Result has 298 places, 464 transitions, 7290 flow
[2024-06-20 19:52:01,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6578, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7290, PETRI_PLACES=298, PETRI_TRANSITIONS=464}
[2024-06-20 19:52:01,697 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places.
[2024-06-20 19:52:01,698 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 464 transitions, 7290 flow
[2024-06-20 19:52:01,698 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:01,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:01,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:01,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 19:52:01,698 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:01,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:01,698 INFO  L85        PathProgramCache]: Analyzing trace with hash -845269360, now seen corresponding path program 2 times
[2024-06-20 19:52:01,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:01,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193455780]
[2024-06-20 19:52:01,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:01,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:01,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:10,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:10,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:10,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193455780]
[2024-06-20 19:52:10,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193455780] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:10,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:10,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:52:10,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600386844]
[2024-06-20 19:52:10,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:10,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:52:10,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:10,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:52:10,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:52:10,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:10,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 464 transitions, 7290 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:10,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:10,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:10,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:13,807 INFO  L124   PetriNetUnfolderBase]: 7000/10882 cut-off events.
[2024-06-20 19:52:13,807 INFO  L125   PetriNetUnfolderBase]: For 899536/899538 co-relation queries the response was YES.
[2024-06-20 19:52:13,927 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94192 conditions, 10882 events. 7000/10882 cut-off events. For 899536/899538 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 68766 event pairs, 2617 based on Foata normal form. 8/10890 useless extension candidates. Maximal degree in co-relation 94040. Up to 10765 conditions per place. 
[2024-06-20 19:52:13,971 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 460 selfloop transitions, 39 changer transitions 0/502 dead transitions.
[2024-06-20 19:52:13,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 502 transitions, 8681 flow
[2024-06-20 19:52:13,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:52:13,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:52:13,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-20 19:52:13,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.409375
[2024-06-20 19:52:13,973 INFO  L175             Difference]: Start difference. First operand has 298 places, 464 transitions, 7290 flow. Second operand 8 states and 131 transitions.
[2024-06-20 19:52:13,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 502 transitions, 8681 flow
[2024-06-20 19:52:16,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 502 transitions, 8469 flow, removed 96 selfloop flow, removed 2 redundant places.
[2024-06-20 19:52:16,114 INFO  L231             Difference]: Finished difference. Result has 304 places, 475 transitions, 7433 flow
[2024-06-20 19:52:16,115 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7134, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7433, PETRI_PLACES=304, PETRI_TRANSITIONS=475}
[2024-06-20 19:52:16,115 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 263 predicate places.
[2024-06-20 19:52:16,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 475 transitions, 7433 flow
[2024-06-20 19:52:16,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:16,115 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:16,115 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:16,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 19:52:16,116 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:16,116 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:16,116 INFO  L85        PathProgramCache]: Analyzing trace with hash -668137840, now seen corresponding path program 3 times
[2024-06-20 19:52:16,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:16,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907080132]
[2024-06-20 19:52:16,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:16,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:16,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:25,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:25,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:25,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907080132]
[2024-06-20 19:52:25,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907080132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:25,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:25,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:52:25,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916772447]
[2024-06-20 19:52:25,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:25,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:52:25,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:25,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:52:25,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:52:25,499 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:25,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 475 transitions, 7433 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:25,500 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:25,500 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:25,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:29,260 INFO  L124   PetriNetUnfolderBase]: 7067/10975 cut-off events.
[2024-06-20 19:52:29,260 INFO  L125   PetriNetUnfolderBase]: For 940763/940765 co-relation queries the response was YES.
[2024-06-20 19:52:29,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96493 conditions, 10975 events. 7067/10975 cut-off events. For 940763/940765 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 69379 event pairs, 2540 based on Foata normal form. 8/10983 useless extension candidates. Maximal degree in co-relation 96339. Up to 10744 conditions per place. 
[2024-06-20 19:52:29,403 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 442 selfloop transitions, 71 changer transitions 0/516 dead transitions.
[2024-06-20 19:52:29,404 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 516 transitions, 9016 flow
[2024-06-20 19:52:29,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:29,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:29,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-20 19:52:29,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4027777777777778
[2024-06-20 19:52:29,405 INFO  L175             Difference]: Start difference. First operand has 304 places, 475 transitions, 7433 flow. Second operand 9 states and 145 transitions.
[2024-06-20 19:52:29,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 516 transitions, 9016 flow
[2024-06-20 19:52:31,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 516 transitions, 8796 flow, removed 76 selfloop flow, removed 5 redundant places.
[2024-06-20 19:52:31,408 INFO  L231             Difference]: Finished difference. Result has 310 places, 488 transitions, 7716 flow
[2024-06-20 19:52:31,408 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7213, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7716, PETRI_PLACES=310, PETRI_TRANSITIONS=488}
[2024-06-20 19:52:31,409 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 269 predicate places.
[2024-06-20 19:52:31,409 INFO  L495      AbstractCegarLoop]: Abstraction has has 310 places, 488 transitions, 7716 flow
[2024-06-20 19:52:31,409 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:31,409 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:31,409 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:31,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 19:52:31,409 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:31,410 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:31,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -667891576, now seen corresponding path program 1 times
[2024-06-20 19:52:31,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:31,410 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761791860]
[2024-06-20 19:52:31,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:31,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:31,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:42,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:42,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:42,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761791860]
[2024-06-20 19:52:42,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761791860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:42,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:42,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:52:42,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120114854]
[2024-06-20 19:52:42,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:42,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:52:42,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:42,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:52:42,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:52:43,038 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:52:43,039 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 488 transitions, 7716 flow. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:43,039 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:43,039 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:52:43,039 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:46,554 INFO  L124   PetriNetUnfolderBase]: 6955/10845 cut-off events.
[2024-06-20 19:52:46,555 INFO  L125   PetriNetUnfolderBase]: For 973872/973945 co-relation queries the response was YES.
[2024-06-20 19:52:46,674 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96974 conditions, 10845 events. 6955/10845 cut-off events. For 973872/973945 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 69016 event pairs, 2586 based on Foata normal form. 28/10854 useless extension candidates. Maximal degree in co-relation 96817. Up to 10620 conditions per place. 
[2024-06-20 19:52:46,723 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 432 selfloop transitions, 37 changer transitions 0/511 dead transitions.
[2024-06-20 19:52:46,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 511 transitions, 8803 flow
[2024-06-20 19:52:46,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:52:46,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:52:46,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-20 19:52:46,724 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.384375
[2024-06-20 19:52:46,724 INFO  L175             Difference]: Start difference. First operand has 310 places, 488 transitions, 7716 flow. Second operand 8 states and 123 transitions.
[2024-06-20 19:52:46,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 511 transitions, 8803 flow
[2024-06-20 19:52:49,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 511 transitions, 8610 flow, removed 85 selfloop flow, removed 3 redundant places.
[2024-06-20 19:52:49,087 INFO  L231             Difference]: Finished difference. Result has 316 places, 492 transitions, 7718 flow
[2024-06-20 19:52:49,088 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7525, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7718, PETRI_PLACES=316, PETRI_TRANSITIONS=492}
[2024-06-20 19:52:49,088 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places.
[2024-06-20 19:52:49,088 INFO  L495      AbstractCegarLoop]: Abstraction has has 316 places, 492 transitions, 7718 flow
[2024-06-20 19:52:49,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:49,088 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:49,088 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:49,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 19:52:49,088 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:49,089 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:49,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -668260662, now seen corresponding path program 3 times
[2024-06-20 19:52:49,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:49,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911238148]
[2024-06-20 19:52:49,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:49,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:49,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:59,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:59,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:59,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911238148]
[2024-06-20 19:52:59,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911238148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:59,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:59,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:52:59,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221472041]
[2024-06-20 19:52:59,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:59,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:52:59,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:59,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:52:59,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:52:59,702 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:59,703 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 492 transitions, 7718 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:59,703 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:59,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:59,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:03,804 INFO  L124   PetriNetUnfolderBase]: 7093/11012 cut-off events.
[2024-06-20 19:53:03,805 INFO  L125   PetriNetUnfolderBase]: For 995736/995736 co-relation queries the response was YES.
[2024-06-20 19:53:03,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 98483 conditions, 11012 events. 7093/11012 cut-off events. For 995736/995736 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 69605 event pairs, 2609 based on Foata normal form. 2/11014 useless extension candidates. Maximal degree in co-relation 98324. Up to 10880 conditions per place. 
[2024-06-20 19:53:03,937 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 470 selfloop transitions, 47 changer transitions 0/520 dead transitions.
[2024-06-20 19:53:03,937 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 520 transitions, 8931 flow
[2024-06-20 19:53:03,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:03,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:03,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions.
[2024-06-20 19:53:03,938 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3861111111111111
[2024-06-20 19:53:03,938 INFO  L175             Difference]: Start difference. First operand has 316 places, 492 transitions, 7718 flow. Second operand 9 states and 139 transitions.
[2024-06-20 19:53:03,938 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 520 transitions, 8931 flow
[2024-06-20 19:53:05,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 520 transitions, 8808 flow, removed 45 selfloop flow, removed 3 redundant places.
[2024-06-20 19:53:05,998 INFO  L231             Difference]: Finished difference. Result has 323 places, 496 transitions, 7798 flow
[2024-06-20 19:53:05,999 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7595, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7798, PETRI_PLACES=323, PETRI_TRANSITIONS=496}
[2024-06-20 19:53:05,999 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places.
[2024-06-20 19:53:05,999 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 496 transitions, 7798 flow
[2024-06-20 19:53:05,999 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:05,999 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:05,999 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:05,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 19:53:06,000 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:06,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:06,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 2102177996, now seen corresponding path program 4 times
[2024-06-20 19:53:06,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:06,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162193949]
[2024-06-20 19:53:06,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:06,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:06,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:14,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:14,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:14,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162193949]
[2024-06-20 19:53:14,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162193949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:14,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:14,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:53:14,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436504485]
[2024-06-20 19:53:14,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:14,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:53:14,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:14,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:53:14,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:53:14,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:14,962 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 496 transitions, 7798 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:14,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:14,962 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:14,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:18,653 INFO  L124   PetriNetUnfolderBase]: 7103/11028 cut-off events.
[2024-06-20 19:53:18,653 INFO  L125   PetriNetUnfolderBase]: For 1025837/1025839 co-relation queries the response was YES.
[2024-06-20 19:53:18,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99060 conditions, 11028 events. 7103/11028 cut-off events. For 1025837/1025839 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 69784 event pairs, 2644 based on Foata normal form. 4/11032 useless extension candidates. Maximal degree in co-relation 98899. Up to 10930 conditions per place. 
[2024-06-20 19:53:18,805 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 484 selfloop transitions, 33 changer transitions 0/520 dead transitions.
[2024-06-20 19:53:18,805 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 520 transitions, 9098 flow
[2024-06-20 19:53:18,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:18,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:18,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:53:18,806 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:53:18,806 INFO  L175             Difference]: Start difference. First operand has 323 places, 496 transitions, 7798 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:53:18,806 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 520 transitions, 9098 flow
[2024-06-20 19:53:21,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 520 transitions, 8976 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-20 19:53:21,036 INFO  L231             Difference]: Finished difference. Result has 327 places, 500 transitions, 7850 flow
[2024-06-20 19:53:21,036 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7676, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7850, PETRI_PLACES=327, PETRI_TRANSITIONS=500}
[2024-06-20 19:53:21,036 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places.
[2024-06-20 19:53:21,036 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 500 transitions, 7850 flow
[2024-06-20 19:53:21,036 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:21,037 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:21,037 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:21,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 19:53:21,037 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:21,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:21,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 946237576, now seen corresponding path program 5 times
[2024-06-20 19:53:21,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:21,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64516633]
[2024-06-20 19:53:21,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:21,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:21,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:30,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:30,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:30,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64516633]
[2024-06-20 19:53:30,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64516633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:30,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:30,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:30,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274594310]
[2024-06-20 19:53:30,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:30,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:30,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:30,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:30,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:31,166 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:31,166 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 500 transitions, 7850 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:31,166 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:31,166 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:31,166 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:34,964 INFO  L124   PetriNetUnfolderBase]: 7113/11042 cut-off events.
[2024-06-20 19:53:34,964 INFO  L125   PetriNetUnfolderBase]: For 1053354/1053356 co-relation queries the response was YES.
[2024-06-20 19:53:35,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99621 conditions, 11042 events. 7113/11042 cut-off events. For 1053354/1053356 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 69837 event pairs, 2599 based on Foata normal form. 2/11044 useless extension candidates. Maximal degree in co-relation 99459. Up to 10779 conditions per place. 
[2024-06-20 19:53:35,122 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 441 selfloop transitions, 85 changer transitions 0/529 dead transitions.
[2024-06-20 19:53:35,122 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 529 transitions, 9332 flow
[2024-06-20 19:53:35,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:35,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:35,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-20 19:53:35,123 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:53:35,123 INFO  L175             Difference]: Start difference. First operand has 327 places, 500 transitions, 7850 flow. Second operand 7 states and 120 transitions.
[2024-06-20 19:53:35,123 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 529 transitions, 9332 flow
[2024-06-20 19:53:37,300 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 529 transitions, 9240 flow, removed 33 selfloop flow, removed 2 redundant places.
[2024-06-20 19:53:37,307 INFO  L231             Difference]: Finished difference. Result has 333 places, 504 transitions, 8094 flow
[2024-06-20 19:53:37,307 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7758, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8094, PETRI_PLACES=333, PETRI_TRANSITIONS=504}
[2024-06-20 19:53:37,307 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places.
[2024-06-20 19:53:37,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 333 places, 504 transitions, 8094 flow
[2024-06-20 19:53:37,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:37,307 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:37,308 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:37,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 19:53:37,308 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:37,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:37,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 946357546, now seen corresponding path program 6 times
[2024-06-20 19:53:37,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:37,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341753882]
[2024-06-20 19:53:37,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:37,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:37,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:46,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:46,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:46,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341753882]
[2024-06-20 19:53:46,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341753882] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:46,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:46,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:46,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917875945]
[2024-06-20 19:53:46,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:46,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:46,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:46,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:46,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:47,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:47,074 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 504 transitions, 8094 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:47,074 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:47,074 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:47,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:50,772 INFO  L124   PetriNetUnfolderBase]: 7095/11017 cut-off events.
[2024-06-20 19:53:50,772 INFO  L125   PetriNetUnfolderBase]: For 1079132/1079134 co-relation queries the response was YES.
[2024-06-20 19:53:50,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99777 conditions, 11017 events. 7095/11017 cut-off events. For 1079132/1079134 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 69695 event pairs, 2622 based on Foata normal form. 8/11025 useless extension candidates. Maximal degree in co-relation 99612. Up to 10856 conditions per place. 
[2024-06-20 19:53:50,945 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 469 selfloop transitions, 51 changer transitions 0/523 dead transitions.
[2024-06-20 19:53:50,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 523 transitions, 9198 flow
[2024-06-20 19:53:50,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:53:50,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:53:50,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-20 19:53:50,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:53:50,946 INFO  L175             Difference]: Start difference. First operand has 333 places, 504 transitions, 8094 flow. Second operand 7 states and 112 transitions.
[2024-06-20 19:53:50,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 523 transitions, 9198 flow
[2024-06-20 19:53:53,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 523 transitions, 8952 flow, removed 70 selfloop flow, removed 5 redundant places.
[2024-06-20 19:53:53,853 INFO  L231             Difference]: Finished difference. Result has 335 places, 504 transitions, 7976 flow
[2024-06-20 19:53:53,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7848, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7976, PETRI_PLACES=335, PETRI_TRANSITIONS=504}
[2024-06-20 19:53:53,854 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 294 predicate places.
[2024-06-20 19:53:53,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 335 places, 504 transitions, 7976 flow
[2024-06-20 19:53:53,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:53,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:53,854 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:53,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 19:53:53,854 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:53,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:53,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -418772532, now seen corresponding path program 7 times
[2024-06-20 19:53:53,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:53,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693239861]
[2024-06-20 19:53:53,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:53,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:53,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:02,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:02,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:02,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693239861]
[2024-06-20 19:54:02,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693239861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:02,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:02,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:02,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309781664]
[2024-06-20 19:54:02,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:02,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:02,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:02,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:02,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:03,049 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:03,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 504 transitions, 7976 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:03,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:03,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:03,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:06,793 INFO  L124   PetriNetUnfolderBase]: 7097/11021 cut-off events.
[2024-06-20 19:54:06,794 INFO  L125   PetriNetUnfolderBase]: For 1068604/1068606 co-relation queries the response was YES.
[2024-06-20 19:54:06,918 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99462 conditions, 11021 events. 7097/11021 cut-off events. For 1068604/1068606 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 69709 event pairs, 2646 based on Foata normal form. 4/11025 useless extension candidates. Maximal degree in co-relation 99298. Up to 10952 conditions per place. 
[2024-06-20 19:54:06,969 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 491 selfloop transitions, 30 changer transitions 0/524 dead transitions.
[2024-06-20 19:54:06,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 524 transitions, 9161 flow
[2024-06-20 19:54:06,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:54:06,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:54:06,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions.
[2024-06-20 19:54:06,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37857142857142856
[2024-06-20 19:54:06,971 INFO  L175             Difference]: Start difference. First operand has 335 places, 504 transitions, 7976 flow. Second operand 7 states and 106 transitions.
[2024-06-20 19:54:06,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 524 transitions, 9161 flow
[2024-06-20 19:54:09,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 524 transitions, 9049 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-20 19:54:09,769 INFO  L231             Difference]: Finished difference. Result has 336 places, 510 transitions, 8049 flow
[2024-06-20 19:54:09,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7864, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8049, PETRI_PLACES=336, PETRI_TRANSITIONS=510}
[2024-06-20 19:54:09,769 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 295 predicate places.
[2024-06-20 19:54:09,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 336 places, 510 transitions, 8049 flow
[2024-06-20 19:54:09,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:09,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:09,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:09,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 19:54:09,770 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:09,770 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:09,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 1162301108, now seen corresponding path program 1 times
[2024-06-20 19:54:09,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:09,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156814201]
[2024-06-20 19:54:09,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:09,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:09,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:18,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:18,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:18,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156814201]
[2024-06-20 19:54:18,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156814201] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:18,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:18,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:18,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797303141]
[2024-06-20 19:54:18,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:18,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:18,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:18,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:18,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:18,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:18,891 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 510 transitions, 8049 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:18,891 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:18,891 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:18,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:22,667 INFO  L124   PetriNetUnfolderBase]: 7139/11079 cut-off events.
[2024-06-20 19:54:22,667 INFO  L125   PetriNetUnfolderBase]: For 1078079/1078081 co-relation queries the response was YES.
[2024-06-20 19:54:22,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100615 conditions, 11079 events. 7139/11079 cut-off events. For 1078079/1078081 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 70131 event pairs, 2519 based on Foata normal form. 8/11087 useless extension candidates. Maximal degree in co-relation 100450. Up to 10847 conditions per place. 
[2024-06-20 19:54:22,832 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 460 selfloop transitions, 84 changer transitions 0/547 dead transitions.
[2024-06-20 19:54:22,832 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 547 transitions, 9550 flow
[2024-06-20 19:54:22,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:54:22,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:54:22,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-20 19:54:22,833 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625
[2024-06-20 19:54:22,833 INFO  L175             Difference]: Start difference. First operand has 336 places, 510 transitions, 8049 flow. Second operand 6 states and 111 transitions.
[2024-06-20 19:54:22,833 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 547 transitions, 9550 flow
[2024-06-20 19:54:25,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 547 transitions, 9398 flow, removed 49 selfloop flow, removed 4 redundant places.
[2024-06-20 19:54:25,179 INFO  L231             Difference]: Finished difference. Result has 339 places, 522 transitions, 8456 flow
[2024-06-20 19:54:25,179 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7897, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8456, PETRI_PLACES=339, PETRI_TRANSITIONS=522}
[2024-06-20 19:54:25,179 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places.
[2024-06-20 19:54:25,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 339 places, 522 transitions, 8456 flow
[2024-06-20 19:54:25,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:25,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:25,180 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:25,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 19:54:25,180 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:25,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:25,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 1162538444, now seen corresponding path program 8 times
[2024-06-20 19:54:25,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:25,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368992902]
[2024-06-20 19:54:25,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:25,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:25,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:34,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:34,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:34,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368992902]
[2024-06-20 19:54:34,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368992902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:34,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:34,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:34,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715554721]
[2024-06-20 19:54:34,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:34,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:34,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:34,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:34,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:34,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:34,502 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 522 transitions, 8456 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:34,502 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:34,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:34,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:38,303 INFO  L124   PetriNetUnfolderBase]: 7047/10919 cut-off events.
[2024-06-20 19:54:38,304 INFO  L125   PetriNetUnfolderBase]: For 1095155/1095157 co-relation queries the response was YES.
[2024-06-20 19:54:38,422 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100342 conditions, 10919 events. 7047/10919 cut-off events. For 1095155/1095157 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 68810 event pairs, 2567 based on Foata normal form. 8/10927 useless extension candidates. Maximal degree in co-relation 100175. Up to 10789 conditions per place. 
[2024-06-20 19:54:38,468 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 493 selfloop transitions, 47 changer transitions 1/544 dead transitions.
[2024-06-20 19:54:38,468 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 544 transitions, 9608 flow
[2024-06-20 19:54:38,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:54:38,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:54:38,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-20 19:54:38,787 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-20 19:54:38,787 INFO  L175             Difference]: Start difference. First operand has 339 places, 522 transitions, 8456 flow. Second operand 7 states and 122 transitions.
[2024-06-20 19:54:38,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 544 transitions, 9608 flow
[2024-06-20 19:54:41,257 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 544 transitions, 9339 flow, removed 54 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:41,264 INFO  L231             Difference]: Finished difference. Result has 341 places, 521 transitions, 8285 flow
[2024-06-20 19:54:41,264 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8187, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8285, PETRI_PLACES=341, PETRI_TRANSITIONS=521}
[2024-06-20 19:54:41,265 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places.
[2024-06-20 19:54:41,265 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 521 transitions, 8285 flow
[2024-06-20 19:54:41,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:41,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:41,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:41,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 19:54:41,265 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:41,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:41,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 571987508, now seen corresponding path program 2 times
[2024-06-20 19:54:41,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:41,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311301175]
[2024-06-20 19:54:41,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:41,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:41,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:49,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:49,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:49,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311301175]
[2024-06-20 19:54:49,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311301175] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:49,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:49,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:49,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325317190]
[2024-06-20 19:54:49,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:49,899 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:49,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:49,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:49,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:50,062 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:50,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 521 transitions, 8285 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:50,063 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:50,063 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:50,063 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:54,078 INFO  L124   PetriNetUnfolderBase]: 6988/10829 cut-off events.
[2024-06-20 19:54:54,078 INFO  L125   PetriNetUnfolderBase]: For 1085305/1085307 co-relation queries the response was YES.
[2024-06-20 19:54:54,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99251 conditions, 10829 events. 6988/10829 cut-off events. For 1085305/1085307 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 68116 event pairs, 2429 based on Foata normal form. 7/10836 useless extension candidates. Maximal degree in co-relation 99084. Up to 10597 conditions per place. 
[2024-06-20 19:54:54,229 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 465 selfloop transitions, 85 changer transitions 0/553 dead transitions.
[2024-06-20 19:54:54,230 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 553 transitions, 9682 flow
[2024-06-20 19:54:54,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:54:54,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:54:54,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 19:54:54,231 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-20 19:54:54,231 INFO  L175             Difference]: Start difference. First operand has 341 places, 521 transitions, 8285 flow. Second operand 7 states and 124 transitions.
[2024-06-20 19:54:54,231 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 553 transitions, 9682 flow
[2024-06-20 19:54:56,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 553 transitions, 9557 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-20 19:54:56,183 INFO  L231             Difference]: Finished difference. Result has 341 places, 526 transitions, 8509 flow
[2024-06-20 19:54:56,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8160, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8509, PETRI_PLACES=341, PETRI_TRANSITIONS=526}
[2024-06-20 19:54:56,185 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places.
[2024-06-20 19:54:56,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 526 transitions, 8509 flow
[2024-06-20 19:54:56,185 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:56,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:56,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:56,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 19:54:56,185 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:56,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:56,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -399738064, now seen corresponding path program 3 times
[2024-06-20 19:54:56,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:56,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836810449]
[2024-06-20 19:54:56,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:56,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:56,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:04,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:04,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:04,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836810449]
[2024-06-20 19:55:04,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836810449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:04,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:04,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:04,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271594241]
[2024-06-20 19:55:04,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:04,992 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:04,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:04,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:04,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:05,111 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:05,111 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 526 transitions, 8509 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:05,111 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:05,111 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:05,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:08,977 INFO  L124   PetriNetUnfolderBase]: 6979/10817 cut-off events.
[2024-06-20 19:55:08,977 INFO  L125   PetriNetUnfolderBase]: For 1106811/1106813 co-relation queries the response was YES.
[2024-06-20 19:55:09,081 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99972 conditions, 10817 events. 6979/10817 cut-off events. For 1106811/1106813 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 68013 event pairs, 2325 based on Foata normal form. 5/10822 useless extension candidates. Maximal degree in co-relation 99804. Up to 10428 conditions per place. 
[2024-06-20 19:55:09,124 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 437 selfloop transitions, 120 changer transitions 0/560 dead transitions.
[2024-06-20 19:55:09,124 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 560 transitions, 9929 flow
[2024-06-20 19:55:09,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:55:09,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:55:09,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-20 19:55:09,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-20 19:55:09,125 INFO  L175             Difference]: Start difference. First operand has 341 places, 526 transitions, 8509 flow. Second operand 7 states and 128 transitions.
[2024-06-20 19:55:09,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 560 transitions, 9929 flow
[2024-06-20 19:55:11,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 560 transitions, 9631 flow, removed 62 selfloop flow, removed 6 redundant places.
[2024-06-20 19:55:11,297 INFO  L231             Difference]: Finished difference. Result has 342 places, 529 transitions, 8584 flow
[2024-06-20 19:55:11,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8211, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8584, PETRI_PLACES=342, PETRI_TRANSITIONS=529}
[2024-06-20 19:55:11,298 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 301 predicate places.
[2024-06-20 19:55:11,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 529 transitions, 8584 flow
[2024-06-20 19:55:11,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:11,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:11,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:11,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 19:55:11,298 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:11,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:11,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 571864872, now seen corresponding path program 4 times
[2024-06-20 19:55:11,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:11,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319132274]
[2024-06-20 19:55:11,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:11,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:11,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:21,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:21,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:21,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319132274]
[2024-06-20 19:55:21,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319132274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:21,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:21,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:21,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269865588]
[2024-06-20 19:55:21,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:21,400 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:21,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:21,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:21,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:21,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:21,587 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 529 transitions, 8584 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:21,587 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:21,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:21,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:25,528 INFO  L124   PetriNetUnfolderBase]: 6981/10819 cut-off events.
[2024-06-20 19:55:25,528 INFO  L125   PetriNetUnfolderBase]: For 1106232/1106232 co-relation queries the response was YES.
[2024-06-20 19:55:25,627 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100288 conditions, 10819 events. 6981/10819 cut-off events. For 1106232/1106232 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 67980 event pairs, 2536 based on Foata normal form. 2/10821 useless extension candidates. Maximal degree in co-relation 100121. Up to 10682 conditions per place. 
[2024-06-20 19:55:25,668 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 508 selfloop transitions, 55 changer transitions 0/566 dead transitions.
[2024-06-20 19:55:25,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 566 transitions, 10024 flow
[2024-06-20 19:55:25,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:55:25,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:55:25,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-20 19:55:25,669 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-20 19:55:25,670 INFO  L175             Difference]: Start difference. First operand has 342 places, 529 transitions, 8584 flow. Second operand 8 states and 141 transitions.
[2024-06-20 19:55:25,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 566 transitions, 10024 flow
[2024-06-20 19:55:28,032 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 566 transitions, 9715 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-20 19:55:28,039 INFO  L231             Difference]: Finished difference. Result has 344 places, 532 transitions, 8457 flow
[2024-06-20 19:55:28,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8277, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8457, PETRI_PLACES=344, PETRI_TRANSITIONS=532}
[2024-06-20 19:55:28,040 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places.
[2024-06-20 19:55:28,040 INFO  L495      AbstractCegarLoop]: Abstraction has has 344 places, 532 transitions, 8457 flow
[2024-06-20 19:55:28,040 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:28,040 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:28,040 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:28,040 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-20 19:55:28,041 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:28,041 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:28,041 INFO  L85        PathProgramCache]: Analyzing trace with hash 572233958, now seen corresponding path program 2 times
[2024-06-20 19:55:28,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:28,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232346441]
[2024-06-20 19:55:28,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:28,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:28,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:38,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-06-20 19:55:38,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:38,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232346441]
[2024-06-20 19:55:38,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232346441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:38,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:38,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:38,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329727366]
[2024-06-20 19:55:38,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:38,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:38,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:38,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:38,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:38,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:55:38,793 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 532 transitions, 8457 flow. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:38,793 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:38,793 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:55:38,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15