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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 18:03:59,302 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:03:59,379 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:03:59,382 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:03:59,382 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:03:59,407 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:03:59,408 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:03:59,409 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:03:59,409 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:03:59,416 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:03:59,416 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:03:59,416 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:03:59,417 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:03:59,418 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:03:59,418 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:03:59,419 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:03:59,419 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:03:59,419 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:03:59,419 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:03:59,419 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:03:59,420 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:03:59,420 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:03:59,420 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:03:59,420 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:03:59,421 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:03:59,421 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:03:59,421 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:03:59,421 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:03:59,422 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:03:59,422 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:03:59,423 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:03:59,423 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:03:59,423 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:03:59,423 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:03:59,423 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:03:59,423 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:03:59,424 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:03:59,424 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:03:59,424 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:03:59,424 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:03:59,424 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:03:59,424 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:03:59,425 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:03:59,425 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 18:03:59,613 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:03:59,632 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:03:59,634 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:03:59,635 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:03:59,635 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:03:59,636 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-04 18:03:59,848 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:03:59,849 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:03:59,849 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:04:00,834 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:04:01,054 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:04:01,054 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:04:01,064 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88155ebb/fe4d74d58e5f45fea88412bc4076c36a/FLAG1e1430d16
[2024-06-04 18:04:01,075 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88155ebb/fe4d74d58e5f45fea88412bc4076c36a
[2024-06-04 18:04:01,076 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:04:01,077 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:04:01,079 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:04:01,080 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:04:01,083 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:04:01,084 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:03:59" (1/2) ...
[2024-06-04 18:04:01,084 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a15be0c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:04:01, skipping insertion in model container
[2024-06-04 18:04:01,085 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:03:59" (1/2) ...
[2024-06-04 18:04:01,086 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2cf444f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:04:01, skipping insertion in model container
[2024-06-04 18:04:01,086 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:04:01" (2/2) ...
[2024-06-04 18:04:01,086 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a15be0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01, skipping insertion in model container
[2024-06-04 18:04:01,087 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:04:01" (2/2) ...
[2024-06-04 18:04:01,087 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:04:01,171 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:04:01,172 INFO  L97    edCorrectnessWitness]: Location invariant before [L857-L857] ((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (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_thd1 >= 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_thd1 >= 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_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_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 )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_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_p2_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_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_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_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_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p2_EBX && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)
[2024-06-04 18:04:01,173 INFO  L97    edCorrectnessWitness]: Location invariant before [L860-L860] ((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (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_thd1 >= 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_thd1 >= 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_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_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 )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_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_p2_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_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_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_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_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p2_EBX && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)
[2024-06-04 18:04:01,173 INFO  L97    edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (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_thd1 >= 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_thd1 >= 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_thd1) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_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 )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_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_p2_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_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_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_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_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p2_EBX && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)
[2024-06-04 18:04:01,174 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:04:01,174 INFO  L106   edCorrectnessWitness]: ghost_update [L855-L855] multithreaded = 1;
[2024-06-04 18:04:01,215 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:04:01,512 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:04:01,525 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:04:01,837 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:04:01,873 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:04:01,874 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01 WrapperNode
[2024-06-04 18:04:01,874 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:04:01,875 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:04:01,876 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:04:01,876 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:04:01,881 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:01,926 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,011 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144
[2024-06-04 18:04:02,012 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:04:02,013 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:04:02,013 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:04:02,013 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:04:02,022 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,022 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,036 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,097 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 18:04:02,097 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,097 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,154 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,156 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,169 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,174 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,198 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:04:02,199 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:04:02,199 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:04:02,199 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:04:02,200 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (1/1) ...
[2024-06-04 18:04:02,204 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:04:02,210 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:04:02,234 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 18:04:02,288 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 18:04:02,323 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:04:02,323 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:04:02,323 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:04:02,324 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:04:02,324 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:04:02,324 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:04:02,324 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:04:02,324 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:04:02,324 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:04:02,324 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:04:02,325 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:04:02,325 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:04:02,326 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:04:02,495 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:04:02,496 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:04:03,460 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:04:03,462 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:04:03,748 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:04:03,749 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:04:03,749 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:04:03 BoogieIcfgContainer
[2024-06-04 18:04:03,750 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:04:03,752 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:04:03,752 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:04:03,754 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:04:03,754 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:03:59" (1/4) ...
[2024-06-04 18:04:03,755 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a739128 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:04:03, skipping insertion in model container
[2024-06-04 18:04:03,755 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:04:01" (2/4) ...
[2024-06-04 18:04:03,756 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a739128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:04:03, skipping insertion in model container
[2024-06-04 18:04:03,756 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:04:01" (3/4) ...
[2024-06-04 18:04:03,756 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a739128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:04:03, skipping insertion in model container
[2024-06-04 18:04:03,757 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:04:03" (4/4) ...
[2024-06-04 18:04:03,757 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:04:03,772 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:04:03,772 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:04:03,772 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:04:03,883 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:04:03,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 18:04:03,963 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-04 18:04:03,963 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:04:03,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 18:04:03,966 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 18:04:03,969 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-04 18:04:03,980 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:04:03,986 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;@699d417e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:04:03,986 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:04:03,994 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:04:03,994 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-04 18:04:03,994 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:04:03,995 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:03,995 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:03,996 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:04,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:04,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1004483788, now seen corresponding path program 1 times
[2024-06-04 18:04:04,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:04,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363841467]
[2024-06-04 18:04:04,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:04,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:04,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:09,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:09,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:09,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363841467]
[2024-06-04 18:04:09,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363841467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:09,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:09,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:04:09,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267605867]
[2024-06-04 18:04:09,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:09,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:04:09,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:09,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:04:09,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:04:09,544 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 18:04:09,546 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:09,546 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:09,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 18:04:09,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:10,622 INFO  L124   PetriNetUnfolderBase]: 1662/2492 cut-off events.
[2024-06-04 18:04:10,622 INFO  L125   PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES.
[2024-06-04 18:04:10,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 2492 events. 1662/2492 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11599 event pairs, 1193 based on Foata normal form. 1/2444 useless extension candidates. Maximal degree in co-relation 5070. Up to 2478 conditions per place. 
[2024-06-04 18:04:10,639 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 35 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 18:04:10,640 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 179 flow
[2024-06-04 18:04:10,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:04:10,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:04:10,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2024-06-04 18:04:10,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-04 18:04:10,652 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 69 transitions.
[2024-06-04 18:04:10,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 179 flow
[2024-06-04 18:04:10,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:04:10,658 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-04 18:04:10,660 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-04 18:04:10,662 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-04 18:04:10,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-04 18:04:10,663 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:10,663 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:10,663 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:10,664 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:04:10,664 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:10,665 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:10,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -1058700245, now seen corresponding path program 1 times
[2024-06-04 18:04:10,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:10,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096036696]
[2024-06-04 18:04:10,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:10,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:10,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:14,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:14,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:14,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096036696]
[2024-06-04 18:04:14,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096036696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:14,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:14,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:04:14,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38465817]
[2024-06-04 18:04:14,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:14,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:04:14,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:14,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:04:14,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:04:14,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 18:04:14,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:14,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:14,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 18:04:14,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:15,567 INFO  L124   PetriNetUnfolderBase]: 1650/2474 cut-off events.
[2024-06-04 18:04:15,567 INFO  L125   PetriNetUnfolderBase]: For 449/457 co-relation queries the response was YES.
[2024-06-04 18:04:15,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 2474 events. 1650/2474 cut-off events. For 449/457 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11421 event pairs, 943 based on Foata normal form. 9/2482 useless extension candidates. Maximal degree in co-relation 5664. Up to 2430 conditions per place. 
[2024-06-04 18:04:15,577 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-04 18:04:15,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 250 flow
[2024-06-04 18:04:15,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:04:15,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:04:15,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions.
[2024-06-04 18:04:15,580 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5297619047619048
[2024-06-04 18:04:15,580 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 89 transitions.
[2024-06-04 18:04:15,581 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 250 flow
[2024-06-04 18:04:15,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:04:15,584 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-04 18:04:15,584 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-04 18:04:15,585 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-04 18:04:15,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-04 18:04:15,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:15,585 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:15,586 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:15,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:04:15,588 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:15,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:15,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 496336778, now seen corresponding path program 1 times
[2024-06-04 18:04:15,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:15,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761059082]
[2024-06-04 18:04:15,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:15,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:15,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:20,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-04 18:04:20,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:20,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761059082]
[2024-06-04 18:04:20,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761059082] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:20,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:20,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 18:04:20,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068125722]
[2024-06-04 18:04:20,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:20,948 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 18:04:20,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:20,949 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 18:04:20,949 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 18:04:21,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 18:04:21,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:21,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:21,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 18:04:21,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:22,140 INFO  L124   PetriNetUnfolderBase]: 1638/2456 cut-off events.
[2024-06-04 18:04:22,141 INFO  L125   PetriNetUnfolderBase]: For 1290/1305 co-relation queries the response was YES.
[2024-06-04 18:04:22,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6251 conditions, 2456 events. 1638/2456 cut-off events. For 1290/1305 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11382 event pairs, 693 based on Foata normal form. 12/2467 useless extension candidates. Maximal degree in co-relation 6234. Up to 2382 conditions per place. 
[2024-06-04 18:04:22,152 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 51 selfloop transitions, 10 changer transitions 0/65 dead transitions.
[2024-06-04 18:04:22,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 332 flow
[2024-06-04 18:04:22,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:04:22,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:04:22,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions.
[2024-06-04 18:04:22,157 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5190476190476191
[2024-06-04 18:04:22,157 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 109 transitions.
[2024-06-04 18:04:22,157 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 332 flow
[2024-06-04 18:04:22,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 318 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 18:04:22,160 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-04 18:04:22,161 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-04 18:04:22,162 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-04 18:04:22,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-04 18:04:22,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:22,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:22,162 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:22,162 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:04:22,162 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:22,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:22,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -1943845815, now seen corresponding path program 1 times
[2024-06-04 18:04:22,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:22,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733093839]
[2024-06-04 18:04:22,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:22,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:22,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:29,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:29,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:29,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733093839]
[2024-06-04 18:04:29,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733093839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:29,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:29,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:04:29,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431440837]
[2024-06-04 18:04:29,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:29,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:04:29,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:29,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:04:29,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:04:29,913 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:04:29,913 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:29,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:29,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:04:29,914 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:30,859 INFO  L124   PetriNetUnfolderBase]: 1643/2463 cut-off events.
[2024-06-04 18:04:30,859 INFO  L125   PetriNetUnfolderBase]: For 2340/2351 co-relation queries the response was YES.
[2024-06-04 18:04:30,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6857 conditions, 2463 events. 1643/2463 cut-off events. For 2340/2351 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11295 event pairs, 885 based on Foata normal form. 10/2472 useless extension candidates. Maximal degree in co-relation 6839. Up to 2434 conditions per place. 
[2024-06-04 18:04:30,872 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 46 selfloop transitions, 8 changer transitions 0/58 dead transitions.
[2024-06-04 18:04:30,872 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 328 flow
[2024-06-04 18:04:30,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:04:30,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:04:30,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-04 18:04:30,874 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 18:04:30,874 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 5 states and 90 transitions.
[2024-06-04 18:04:30,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 328 flow
[2024-06-04 18:04:30,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 304 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 18:04:30,878 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 188 flow
[2024-06-04 18:04:30,878 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2024-06-04 18:04:30,880 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-04 18:04:30,880 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 188 flow
[2024-06-04 18:04:30,880 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:30,880 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:30,880 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:30,880 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:04:30,880 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:30,881 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:30,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 238298857, now seen corresponding path program 1 times
[2024-06-04 18:04:30,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:30,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031016645]
[2024-06-04 18:04:30,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:30,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:30,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:37,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:37,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:37,065 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031016645]
[2024-06-04 18:04:37,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031016645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:37,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:37,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:04:37,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094649261]
[2024-06-04 18:04:37,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:37,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:04:37,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:37,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:04:37,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:04:37,192 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 18:04:37,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 188 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:37,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:37,194 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 18:04:37,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:38,304 INFO  L124   PetriNetUnfolderBase]: 1634/2448 cut-off events.
[2024-06-04 18:04:38,304 INFO  L125   PetriNetUnfolderBase]: For 3043/3054 co-relation queries the response was YES.
[2024-06-04 18:04:38,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7357 conditions, 2448 events. 1634/2448 cut-off events. For 3043/3054 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11150 event pairs, 545 based on Foata normal form. 12/2459 useless extension candidates. Maximal degree in co-relation 7337. Up to 2344 conditions per place. 
[2024-06-04 18:04:38,317 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 58 selfloop transitions, 12 changer transitions 0/74 dead transitions.
[2024-06-04 18:04:38,317 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 406 flow
[2024-06-04 18:04:38,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:04:38,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:04:38,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions.
[2024-06-04 18:04:38,320 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49206349206349204
[2024-06-04 18:04:38,320 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 188 flow. Second operand 6 states and 124 transitions.
[2024-06-04 18:04:38,320 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 406 flow
[2024-06-04 18:04:38,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 394 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:04:38,322 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 219 flow
[2024-06-04 18:04:38,323 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2024-06-04 18:04:38,323 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places.
[2024-06-04 18:04:38,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 219 flow
[2024-06-04 18:04:38,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:38,324 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:38,324 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:38,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:04:38,324 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:38,324 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:38,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -163638534, now seen corresponding path program 1 times
[2024-06-04 18:04:38,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:38,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016206544]
[2024-06-04 18:04:38,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:38,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:38,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:45,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:45,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:45,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016206544]
[2024-06-04 18:04:45,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016206544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:45,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:45,436 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:04:45,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649591483]
[2024-06-04 18:04:45,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:45,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:04:45,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:45,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:04:45,437 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:04:45,549 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:04:45,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 219 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:45,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:45,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:04:45,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:46,511 INFO  L124   PetriNetUnfolderBase]: 1903/2832 cut-off events.
[2024-06-04 18:04:46,512 INFO  L125   PetriNetUnfolderBase]: For 5013/5013 co-relation queries the response was YES.
[2024-06-04 18:04:46,516 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8899 conditions, 2832 events. 1903/2832 cut-off events. For 5013/5013 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12922 event pairs, 1026 based on Foata normal form. 2/2834 useless extension candidates. Maximal degree in co-relation 8879. Up to 2801 conditions per place. 
[2024-06-04 18:04:46,526 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 56 selfloop transitions, 11 changer transitions 0/70 dead transitions.
[2024-06-04 18:04:46,526 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 431 flow
[2024-06-04 18:04:46,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:04:46,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:04:46,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-04 18:04:46,527 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38492063492063494
[2024-06-04 18:04:46,527 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 219 flow. Second operand 6 states and 97 transitions.
[2024-06-04 18:04:46,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 431 flow
[2024-06-04 18:04:46,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 394 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 18:04:46,531 INFO  L231             Difference]: Finished difference. Result has 57 places, 55 transitions, 274 flow
[2024-06-04 18:04:46,531 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=57, PETRI_TRANSITIONS=55}
[2024-06-04 18:04:46,531 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-04 18:04:46,532 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 274 flow
[2024-06-04 18:04:46,532 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:46,532 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:46,532 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:46,532 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:04:46,532 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:46,533 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:46,533 INFO  L85        PathProgramCache]: Analyzing trace with hash -287765952, now seen corresponding path program 1 times
[2024-06-04 18:04:46,533 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:46,533 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633220973]
[2024-06-04 18:04:46,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:46,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:46,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:53,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:53,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:53,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633220973]
[2024-06-04 18:04:53,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633220973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:53,560 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:53,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:04:53,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114550851]
[2024-06-04 18:04:53,560 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:53,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:04:53,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:53,561 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:04:53,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:04:53,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:04:53,675 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 274 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:53,675 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:53,675 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:04:53,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:54,789 INFO  L124   PetriNetUnfolderBase]: 1833/2744 cut-off events.
[2024-06-04 18:04:54,789 INFO  L125   PetriNetUnfolderBase]: For 7081/7139 co-relation queries the response was YES.
[2024-06-04 18:04:54,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9414 conditions, 2744 events. 1833/2744 cut-off events. For 7081/7139 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12627 event pairs, 805 based on Foata normal form. 15/2749 useless extension candidates. Maximal degree in co-relation 9390. Up to 2667 conditions per place. 
[2024-06-04 18:04:54,801 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 16 changer transitions 0/80 dead transitions.
[2024-06-04 18:04:54,801 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 496 flow
[2024-06-04 18:04:54,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:04:54,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:04:54,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-04 18:04:54,802 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-04 18:04:54,802 INFO  L175             Difference]: Start difference. First operand has 57 places, 55 transitions, 274 flow. Second operand 6 states and 107 transitions.
[2024-06-04 18:04:54,802 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 496 flow
[2024-06-04 18:04:54,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 488 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-06-04 18:04:54,806 INFO  L231             Difference]: Finished difference. Result has 63 places, 61 transitions, 347 flow
[2024-06-04 18:04:54,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=63, PETRI_TRANSITIONS=61}
[2024-06-04 18:04:54,807 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-04 18:04:54,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 347 flow
[2024-06-04 18:04:54,807 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:54,807 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:54,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:54,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:04:54,808 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:54,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:54,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -253624722, now seen corresponding path program 2 times
[2024-06-04 18:04:54,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:54,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291072410]
[2024-06-04 18:04:54,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:54,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:54,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:01,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:01,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:01,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291072410]
[2024-06-04 18:05:01,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291072410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:01,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:01,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:05:01,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810188146]
[2024-06-04 18:05:01,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:01,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:05:01,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:01,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:05:01,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:05:02,063 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:05:02,063 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 347 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:02,063 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:02,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:05:02,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:03,106 INFO  L124   PetriNetUnfolderBase]: 1877/2810 cut-off events.
[2024-06-04 18:05:03,107 INFO  L125   PetriNetUnfolderBase]: For 9830/9885 co-relation queries the response was YES.
[2024-06-04 18:05:03,111 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10607 conditions, 2810 events. 1877/2810 cut-off events. For 9830/9885 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12973 event pairs, 786 based on Foata normal form. 18/2816 useless extension candidates. Maximal degree in co-relation 10579. Up to 2685 conditions per place. 
[2024-06-04 18:05:03,119 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 58 selfloop transitions, 23 changer transitions 0/88 dead transitions.
[2024-06-04 18:05:03,119 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 649 flow
[2024-06-04 18:05:03,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:05:03,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:05:03,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-04 18:05:03,122 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43253968253968256
[2024-06-04 18:05:03,122 INFO  L175             Difference]: Start difference. First operand has 63 places, 61 transitions, 347 flow. Second operand 6 states and 109 transitions.
[2024-06-04 18:05:03,122 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 649 flow
[2024-06-04 18:05:03,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 624 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-06-04 18:05:03,128 INFO  L231             Difference]: Finished difference. Result has 68 places, 69 transitions, 463 flow
[2024-06-04 18:05:03,128 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=68, PETRI_TRANSITIONS=69}
[2024-06-04 18:05:03,130 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-04 18:05:03,130 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 463 flow
[2024-06-04 18:05:03,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:03,131 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:03,131 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:03,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:05:03,131 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:03,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:03,132 INFO  L85        PathProgramCache]: Analyzing trace with hash 274988040, now seen corresponding path program 1 times
[2024-06-04 18:05:03,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:03,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206537658]
[2024-06-04 18:05:03,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:03,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:03,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:11,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:11,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:11,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206537658]
[2024-06-04 18:05:11,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206537658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:11,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:11,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:11,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894068756]
[2024-06-04 18:05:11,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:11,171 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:11,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:11,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:11,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:11,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:05:11,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 463 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:11,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:11,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:05:11,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:12,354 INFO  L124   PetriNetUnfolderBase]: 1938/2883 cut-off events.
[2024-06-04 18:05:12,354 INFO  L125   PetriNetUnfolderBase]: For 12062/12062 co-relation queries the response was YES.
[2024-06-04 18:05:12,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11234 conditions, 2883 events. 1938/2883 cut-off events. For 12062/12062 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13285 event pairs, 861 based on Foata normal form. 2/2885 useless extension candidates. Maximal degree in co-relation 11203. Up to 2843 conditions per place. 
[2024-06-04 18:05:12,366 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 74 selfloop transitions, 14 changer transitions 0/91 dead transitions.
[2024-06-04 18:05:12,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 701 flow
[2024-06-04 18:05:12,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:12,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:12,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-04 18:05:12,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37755102040816324
[2024-06-04 18:05:12,368 INFO  L175             Difference]: Start difference. First operand has 68 places, 69 transitions, 463 flow. Second operand 7 states and 111 transitions.
[2024-06-04 18:05:12,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 701 flow
[2024-06-04 18:05:12,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 668 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-06-04 18:05:12,375 INFO  L231             Difference]: Finished difference. Result has 73 places, 72 transitions, 486 flow
[2024-06-04 18:05:12,376 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=73, PETRI_TRANSITIONS=72}
[2024-06-04 18:05:12,376 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places.
[2024-06-04 18:05:12,376 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 486 flow
[2024-06-04 18:05:12,376 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:12,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:12,377 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:12,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:05:12,377 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:12,377 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:12,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1450266198, now seen corresponding path program 1 times
[2024-06-04 18:05:12,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:12,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331237265]
[2024-06-04 18:05:12,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:12,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:12,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:19,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:19,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:19,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331237265]
[2024-06-04 18:05:19,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331237265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:19,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:19,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:19,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460433426]
[2024-06-04 18:05:19,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:19,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:19,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:19,573 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:19,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:19,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:05:19,717 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 486 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:19,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:19,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:05:19,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:20,821 INFO  L124   PetriNetUnfolderBase]: 1830/2743 cut-off events.
[2024-06-04 18:05:20,821 INFO  L125   PetriNetUnfolderBase]: For 15939/16003 co-relation queries the response was YES.
[2024-06-04 18:05:20,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11565 conditions, 2743 events. 1830/2743 cut-off events. For 15939/16003 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12754 event pairs, 756 based on Foata normal form. 33/2720 useless extension candidates. Maximal degree in co-relation 11532. Up to 2616 conditions per place. 
[2024-06-04 18:05:20,835 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 66 selfloop transitions, 18 changer transitions 0/92 dead transitions.
[2024-06-04 18:05:20,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 719 flow
[2024-06-04 18:05:20,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:05:20,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:05:20,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-04 18:05:20,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-04 18:05:20,837 INFO  L175             Difference]: Start difference. First operand has 73 places, 72 transitions, 486 flow. Second operand 6 states and 107 transitions.
[2024-06-04 18:05:20,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 719 flow
[2024-06-04 18:05:20,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 667 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 18:05:20,847 INFO  L231             Difference]: Finished difference. Result has 74 places, 73 transitions, 499 flow
[2024-06-04 18:05:20,848 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=74, PETRI_TRANSITIONS=73}
[2024-06-04 18:05:20,849 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places.
[2024-06-04 18:05:20,849 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 499 flow
[2024-06-04 18:05:20,849 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:20,849 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:20,849 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:20,850 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:05:20,850 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:20,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:20,850 INFO  L85        PathProgramCache]: Analyzing trace with hash -330808593, now seen corresponding path program 1 times
[2024-06-04 18:05:20,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:20,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697133484]
[2024-06-04 18:05:20,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:20,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:20,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:27,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:27,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:27,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697133484]
[2024-06-04 18:05:27,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697133484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:27,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:27,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:27,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68811857]
[2024-06-04 18:05:27,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:27,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:27,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:27,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:27,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:28,033 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:05:28,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 499 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:28,034 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:28,034 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:05:28,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:29,180 INFO  L124   PetriNetUnfolderBase]: 1952/2906 cut-off events.
[2024-06-04 18:05:29,180 INFO  L125   PetriNetUnfolderBase]: For 16473/16477 co-relation queries the response was YES.
[2024-06-04 18:05:29,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12180 conditions, 2906 events. 1952/2906 cut-off events. For 16473/16477 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13246 event pairs, 833 based on Foata normal form. 8/2914 useless extension candidates. Maximal degree in co-relation 12146. Up to 2820 conditions per place. 
[2024-06-04 18:05:29,193 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 89 selfloop transitions, 17 changer transitions 0/109 dead transitions.
[2024-06-04 18:05:29,193 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 869 flow
[2024-06-04 18:05:29,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:29,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:29,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:05:29,196 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3979591836734694
[2024-06-04 18:05:29,196 INFO  L175             Difference]: Start difference. First operand has 74 places, 73 transitions, 499 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:05:29,196 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 869 flow
[2024-06-04 18:05:29,203 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 831 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 18:05:29,204 INFO  L231             Difference]: Finished difference. Result has 80 places, 85 transitions, 631 flow
[2024-06-04 18:05:29,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=80, PETRI_TRANSITIONS=85}
[2024-06-04 18:05:29,205 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-04 18:05:29,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 631 flow
[2024-06-04 18:05:29,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:29,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:29,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:29,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:05:29,205 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:29,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:29,206 INFO  L85        PathProgramCache]: Analyzing trace with hash -65313883, now seen corresponding path program 2 times
[2024-06-04 18:05:29,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:29,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416259436]
[2024-06-04 18:05:29,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:29,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:29,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:36,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:36,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:36,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416259436]
[2024-06-04 18:05:36,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416259436] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:36,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:36,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:36,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300378808]
[2024-06-04 18:05:36,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:36,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:36,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:36,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:36,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:36,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:05:36,980 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 631 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:36,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:36,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:05:36,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:38,088 INFO  L124   PetriNetUnfolderBase]: 1996/2972 cut-off events.
[2024-06-04 18:05:38,089 INFO  L125   PetriNetUnfolderBase]: For 20702/20710 co-relation queries the response was YES.
[2024-06-04 18:05:38,094 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13144 conditions, 2972 events. 1996/2972 cut-off events. For 20702/20710 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13698 event pairs, 782 based on Foata normal form. 16/2988 useless extension candidates. Maximal degree in co-relation 13106. Up to 2707 conditions per place. 
[2024-06-04 18:05:38,100 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 86 selfloop transitions, 33 changer transitions 0/122 dead transitions.
[2024-06-04 18:05:38,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 122 transitions, 1069 flow
[2024-06-04 18:05:38,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:38,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:38,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 18:05:38,102 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-04 18:05:38,103 INFO  L175             Difference]: Start difference. First operand has 80 places, 85 transitions, 631 flow. Second operand 7 states and 122 transitions.
[2024-06-04 18:05:38,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 122 transitions, 1069 flow
[2024-06-04 18:05:38,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 122 transitions, 1045 flow, removed 11 selfloop flow, removed 1 redundant places.
[2024-06-04 18:05:38,113 INFO  L231             Difference]: Finished difference. Result has 87 places, 97 transitions, 798 flow
[2024-06-04 18:05:38,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=798, PETRI_PLACES=87, PETRI_TRANSITIONS=97}
[2024-06-04 18:05:38,113 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-04 18:05:38,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 97 transitions, 798 flow
[2024-06-04 18:05:38,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:38,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:38,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:38,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:05:38,114 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:38,114 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:38,115 INFO  L85        PathProgramCache]: Analyzing trace with hash -65580793, now seen corresponding path program 3 times
[2024-06-04 18:05:38,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:38,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788266182]
[2024-06-04 18:05:38,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:38,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:38,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:45,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:45,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:45,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788266182]
[2024-06-04 18:05:45,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788266182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:45,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:45,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:45,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133687815]
[2024-06-04 18:05:45,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:45,326 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:45,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:45,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:45,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:45,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:05:45,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 97 transitions, 798 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:45,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:45,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:05:45,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:46,654 INFO  L124   PetriNetUnfolderBase]: 2002/2981 cut-off events.
[2024-06-04 18:05:46,654 INFO  L125   PetriNetUnfolderBase]: For 24757/24765 co-relation queries the response was YES.
[2024-06-04 18:05:46,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14154 conditions, 2981 events. 2002/2981 cut-off events. For 24757/24765 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13708 event pairs, 789 based on Foata normal form. 12/2993 useless extension candidates. Maximal degree in co-relation 14112. Up to 2713 conditions per place. 
[2024-06-04 18:05:46,668 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 88 selfloop transitions, 35 changer transitions 0/126 dead transitions.
[2024-06-04 18:05:46,668 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 126 transitions, 1205 flow
[2024-06-04 18:05:46,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:46,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:46,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 18:05:46,670 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-04 18:05:46,670 INFO  L175             Difference]: Start difference. First operand has 87 places, 97 transitions, 798 flow. Second operand 7 states and 123 transitions.
[2024-06-04 18:05:46,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 126 transitions, 1205 flow
[2024-06-04 18:05:46,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 126 transitions, 1163 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-04 18:05:46,686 INFO  L231             Difference]: Finished difference. Result has 92 places, 101 transitions, 877 flow
[2024-06-04 18:05:46,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=877, PETRI_PLACES=92, PETRI_TRANSITIONS=101}
[2024-06-04 18:05:46,687 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-04 18:05:46,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 101 transitions, 877 flow
[2024-06-04 18:05:46,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:46,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:46,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:46,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:05:46,687 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:46,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:46,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 1657202265, now seen corresponding path program 1 times
[2024-06-04 18:05:46,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:46,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934576975]
[2024-06-04 18:05:46,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:46,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:46,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:55,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:55,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:55,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934576975]
[2024-06-04 18:05:55,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934576975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:55,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:55,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:55,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392174727]
[2024-06-04 18:05:55,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:55,106 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:55,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:55,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:55,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:55,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:05:55,275 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 101 transitions, 877 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:55,275 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:55,275 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:05:55,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:56,488 INFO  L124   PetriNetUnfolderBase]: 1994/2965 cut-off events.
[2024-06-04 18:05:56,489 INFO  L125   PetriNetUnfolderBase]: For 27273/27273 co-relation queries the response was YES.
[2024-06-04 18:05:56,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14375 conditions, 2965 events. 1994/2965 cut-off events. For 27273/27273 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13591 event pairs, 787 based on Foata normal form. 4/2969 useless extension candidates. Maximal degree in co-relation 14331. Up to 2907 conditions per place. 
[2024-06-04 18:05:56,502 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 108 selfloop transitions, 16 changer transitions 0/127 dead transitions.
[2024-06-04 18:05:56,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1201 flow
[2024-06-04 18:05:56,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:05:56,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:05:56,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-04 18:05:56,505 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37202380952380953
[2024-06-04 18:05:56,505 INFO  L175             Difference]: Start difference. First operand has 92 places, 101 transitions, 877 flow. Second operand 8 states and 125 transitions.
[2024-06-04 18:05:56,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1201 flow
[2024-06-04 18:05:56,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 1144 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-04 18:05:56,520 INFO  L231             Difference]: Finished difference. Result has 97 places, 103 transitions, 879 flow
[2024-06-04 18:05:56,520 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=879, PETRI_PLACES=97, PETRI_TRANSITIONS=103}
[2024-06-04 18:05:56,520 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2024-06-04 18:05:56,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 879 flow
[2024-06-04 18:05:56,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:56,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:56,521 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:56,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:05:56,521 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:56,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:56,522 INFO  L85        PathProgramCache]: Analyzing trace with hash 2003991699, now seen corresponding path program 1 times
[2024-06-04 18:05:56,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:56,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87879284]
[2024-06-04 18:05:56,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:56,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:56,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:05,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:05,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:05,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87879284]
[2024-06-04 18:06:05,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87879284] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:05,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:05,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:05,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139114047]
[2024-06-04 18:06:05,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:05,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:05,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:05,879 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:05,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:06,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:06:06,053 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 879 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:06,053 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:06,053 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:06:06,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:07,402 INFO  L124   PetriNetUnfolderBase]: 1923/2883 cut-off events.
[2024-06-04 18:06:07,402 INFO  L125   PetriNetUnfolderBase]: For 33521/33605 co-relation queries the response was YES.
[2024-06-04 18:06:07,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14624 conditions, 2883 events. 1923/2883 cut-off events. For 33521/33605 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13413 event pairs, 585 based on Foata normal form. 19/2838 useless extension candidates. Maximal degree in co-relation 14579. Up to 2707 conditions per place. 
[2024-06-04 18:06:07,417 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 94 selfloop transitions, 21 changer transitions 0/133 dead transitions.
[2024-06-04 18:06:07,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 133 transitions, 1203 flow
[2024-06-04 18:06:07,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:07,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:07,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 18:06:07,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 18:06:07,419 INFO  L175             Difference]: Start difference. First operand has 97 places, 103 transitions, 879 flow. Second operand 7 states and 126 transitions.
[2024-06-04 18:06:07,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 133 transitions, 1203 flow
[2024-06-04 18:06:07,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 133 transitions, 1162 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 18:06:07,432 INFO  L231             Difference]: Finished difference. Result has 98 places, 106 transitions, 920 flow
[2024-06-04 18:06:07,433 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=920, PETRI_PLACES=98, PETRI_TRANSITIONS=106}
[2024-06-04 18:06:07,433 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-04 18:06:07,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 920 flow
[2024-06-04 18:06:07,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:07,434 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:07,434 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:07,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:06:07,434 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:07,434 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:07,434 INFO  L85        PathProgramCache]: Analyzing trace with hash 2004111669, now seen corresponding path program 2 times
[2024-06-04 18:06:07,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:07,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076463840]
[2024-06-04 18:06:07,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:07,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:07,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:15,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:15,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:15,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076463840]
[2024-06-04 18:06:15,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076463840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:15,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:15,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:15,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921796275]
[2024-06-04 18:06:15,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:15,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:15,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:15,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:15,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:15,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:06:15,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 920 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:15,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:15,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:06:15,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:16,781 INFO  L124   PetriNetUnfolderBase]: 1945/2917 cut-off events.
[2024-06-04 18:06:16,781 INFO  L125   PetriNetUnfolderBase]: For 38509/38599 co-relation queries the response was YES.
[2024-06-04 18:06:16,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15405 conditions, 2917 events. 1945/2917 cut-off events. For 38509/38599 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13591 event pairs, 580 based on Foata normal form. 26/2877 useless extension candidates. Maximal degree in co-relation 15359. Up to 2681 conditions per place. 
[2024-06-04 18:06:16,796 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 85 selfloop transitions, 32 changer transitions 0/135 dead transitions.
[2024-06-04 18:06:16,796 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 135 transitions, 1252 flow
[2024-06-04 18:06:16,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:16,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:16,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 18:06:16,801 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-04 18:06:16,801 INFO  L175             Difference]: Start difference. First operand has 98 places, 106 transitions, 920 flow. Second operand 7 states and 127 transitions.
[2024-06-04 18:06:16,801 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 135 transitions, 1252 flow
[2024-06-04 18:06:16,818 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 135 transitions, 1194 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-04 18:06:16,819 INFO  L231             Difference]: Finished difference. Result has 100 places, 109 transitions, 975 flow
[2024-06-04 18:06:16,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=975, PETRI_PLACES=100, PETRI_TRANSITIONS=109}
[2024-06-04 18:06:16,820 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-04 18:06:16,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 975 flow
[2024-06-04 18:06:16,820 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:16,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:16,821 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:16,821 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:06:16,821 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:16,821 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:16,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 2004111855, now seen corresponding path program 1 times
[2024-06-04 18:06:16,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:16,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400673962]
[2024-06-04 18:06:16,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:16,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:16,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:24,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:24,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:24,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400673962]
[2024-06-04 18:06:24,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400673962] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:24,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:24,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:24,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378866609]
[2024-06-04 18:06:24,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:24,742 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:24,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:24,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:24,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:24,825 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:06:24,825 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 975 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:24,825 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:24,825 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:06:24,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:26,108 INFO  L124   PetriNetUnfolderBase]: 2053/3050 cut-off events.
[2024-06-04 18:06:26,109 INFO  L125   PetriNetUnfolderBase]: For 39720/39720 co-relation queries the response was YES.
[2024-06-04 18:06:26,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16229 conditions, 3050 events. 2053/3050 cut-off events. For 39720/39720 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14003 event pairs, 749 based on Foata normal form. 2/3052 useless extension candidates. Maximal degree in co-relation 16182. Up to 2948 conditions per place. 
[2024-06-04 18:06:26,125 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 111 selfloop transitions, 22 changer transitions 0/136 dead transitions.
[2024-06-04 18:06:26,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 136 transitions, 1337 flow
[2024-06-04 18:06:26,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:26,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:26,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:06:26,127 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3979591836734694
[2024-06-04 18:06:26,127 INFO  L175             Difference]: Start difference. First operand has 100 places, 109 transitions, 975 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:06:26,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 136 transitions, 1337 flow
[2024-06-04 18:06:26,143 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 136 transitions, 1254 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-04 18:06:26,144 INFO  L231             Difference]: Finished difference. Result has 102 places, 112 transitions, 986 flow
[2024-06-04 18:06:26,145 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=986, PETRI_PLACES=102, PETRI_TRANSITIONS=112}
[2024-06-04 18:06:26,145 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places.
[2024-06-04 18:06:26,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 112 transitions, 986 flow
[2024-06-04 18:06:26,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:26,145 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:26,145 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:26,146 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:06:26,146 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:26,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:26,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 2034062921, now seen corresponding path program 1 times
[2024-06-04 18:06:26,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:26,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263656696]
[2024-06-04 18:06:26,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:26,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:26,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:34,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:34,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:34,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263656696]
[2024-06-04 18:06:34,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263656696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:34,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:34,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:34,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286374889]
[2024-06-04 18:06:34,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:34,149 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:34,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:34,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:34,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:34,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:06:34,248 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 112 transitions, 986 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:34,248 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:34,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:06:34,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:35,570 INFO  L124   PetriNetUnfolderBase]: 2075/3084 cut-off events.
[2024-06-04 18:06:35,570 INFO  L125   PetriNetUnfolderBase]: For 44105/44113 co-relation queries the response was YES.
[2024-06-04 18:06:35,576 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16658 conditions, 3084 events. 2075/3084 cut-off events. For 44105/44113 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14177 event pairs, 753 based on Foata normal form. 12/3096 useless extension candidates. Maximal degree in co-relation 16610. Up to 2975 conditions per place. 
[2024-06-04 18:06:35,584 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 121 selfloop transitions, 20 changer transitions 0/144 dead transitions.
[2024-06-04 18:06:35,584 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 144 transitions, 1379 flow
[2024-06-04 18:06:35,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:06:35,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:06:35,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 18:06:35,586 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-04 18:06:35,586 INFO  L175             Difference]: Start difference. First operand has 102 places, 112 transitions, 986 flow. Second operand 8 states and 132 transitions.
[2024-06-04 18:06:35,586 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 144 transitions, 1379 flow
[2024-06-04 18:06:35,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 144 transitions, 1339 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-04 18:06:35,605 INFO  L231             Difference]: Finished difference. Result has 107 places, 115 transitions, 1033 flow
[2024-06-04 18:06:35,605 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1033, PETRI_PLACES=107, PETRI_TRANSITIONS=115}
[2024-06-04 18:06:35,605 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places.
[2024-06-04 18:06:35,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 1033 flow
[2024-06-04 18:06:35,606 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:35,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:35,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:35,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:06:35,606 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:35,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:35,606 INFO  L85        PathProgramCache]: Analyzing trace with hash -2024729015, now seen corresponding path program 2 times
[2024-06-04 18:06:35,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:35,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906716059]
[2024-06-04 18:06:35,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:35,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:35,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:43,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:43,277 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:43,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906716059]
[2024-06-04 18:06:43,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906716059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:43,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:43,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:06:43,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192769745]
[2024-06-04 18:06:43,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:43,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:06:43,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:43,278 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:06:43,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:06:43,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:06:43,475 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 1033 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:43,475 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:43,475 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:06:43,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:44,579 INFO  L124   PetriNetUnfolderBase]: 2065/3072 cut-off events.
[2024-06-04 18:06:44,579 INFO  L125   PetriNetUnfolderBase]: For 48115/48123 co-relation queries the response was YES.
[2024-06-04 18:06:44,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16824 conditions, 3072 events. 2065/3072 cut-off events. For 48115/48123 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14097 event pairs, 750 based on Foata normal form. 12/3084 useless extension candidates. Maximal degree in co-relation 16775. Up to 2819 conditions per place. 
[2024-06-04 18:06:44,596 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 93 selfloop transitions, 43 changer transitions 0/139 dead transitions.
[2024-06-04 18:06:44,596 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 139 transitions, 1377 flow
[2024-06-04 18:06:44,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:44,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:44,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 18:06:44,599 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 18:06:44,599 INFO  L175             Difference]: Start difference. First operand has 107 places, 115 transitions, 1033 flow. Second operand 7 states and 119 transitions.
[2024-06-04 18:06:44,599 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 139 transitions, 1377 flow
[2024-06-04 18:06:44,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 1319 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-04 18:06:44,621 INFO  L231             Difference]: Finished difference. Result has 109 places, 117 transitions, 1113 flow
[2024-06-04 18:06:44,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1113, PETRI_PLACES=109, PETRI_TRANSITIONS=117}
[2024-06-04 18:06:44,622 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-04 18:06:44,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 117 transitions, 1113 flow
[2024-06-04 18:06:44,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:44,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:44,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:44,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:06:44,622 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:44,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:44,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 1079813581, now seen corresponding path program 3 times
[2024-06-04 18:06:44,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:44,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655264456]
[2024-06-04 18:06:44,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:44,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:44,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:53,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:53,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:53,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655264456]
[2024-06-04 18:06:53,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655264456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:53,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:53,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:06:53,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580497886]
[2024-06-04 18:06:53,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:53,587 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:06:53,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:53,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:06:53,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:06:53,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:06:53,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 117 transitions, 1113 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:53,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:53,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:06:53,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:55,028 INFO  L124   PetriNetUnfolderBase]: 1962/2948 cut-off events.
[2024-06-04 18:06:55,029 INFO  L125   PetriNetUnfolderBase]: For 56591/56702 co-relation queries the response was YES.
[2024-06-04 18:06:55,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17135 conditions, 2948 events. 1962/2948 cut-off events. For 56591/56702 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13840 event pairs, 575 based on Foata normal form. 25/2897 useless extension candidates. Maximal degree in co-relation 17084. Up to 2652 conditions per place. 
[2024-06-04 18:06:55,045 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 84 selfloop transitions, 39 changer transitions 0/144 dead transitions.
[2024-06-04 18:06:55,045 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 144 transitions, 1459 flow
[2024-06-04 18:06:55,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:55,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:55,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 18:06:55,046 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-04 18:06:55,046 INFO  L175             Difference]: Start difference. First operand has 109 places, 117 transitions, 1113 flow. Second operand 7 states and 127 transitions.
[2024-06-04 18:06:55,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 144 transitions, 1459 flow
[2024-06-04 18:06:55,071 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 144 transitions, 1335 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-04 18:06:55,072 INFO  L231             Difference]: Finished difference. Result has 109 places, 120 transitions, 1120 flow
[2024-06-04 18:06:55,073 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1120, PETRI_PLACES=109, PETRI_TRANSITIONS=120}
[2024-06-04 18:06:55,073 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-04 18:06:55,073 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 120 transitions, 1120 flow
[2024-06-04 18:06:55,073 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:55,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:55,074 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:55,074 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:06:55,074 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:55,074 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:55,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -1390629762, now seen corresponding path program 1 times
[2024-06-04 18:06:55,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:55,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295297442]
[2024-06-04 18:06:55,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:55,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:55,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:05,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:05,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:05,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295297442]
[2024-06-04 18:07:05,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295297442] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:05,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:05,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:07:05,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961423606]
[2024-06-04 18:07:05,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:05,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:07:05,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:05,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:07:05,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:07:05,193 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:07:05,194 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 120 transitions, 1120 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:05,194 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:05,194 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:07:05,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:06,248 INFO  L124   PetriNetUnfolderBase]: 2043/3038 cut-off events.
[2024-06-04 18:07:06,248 INFO  L125   PetriNetUnfolderBase]: For 50212/50212 co-relation queries the response was YES.
[2024-06-04 18:07:06,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17238 conditions, 3038 events. 2043/3038 cut-off events. For 50212/50212 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13914 event pairs, 746 based on Foata normal form. 2/3040 useless extension candidates. Maximal degree in co-relation 17187. Up to 3016 conditions per place. 
[2024-06-04 18:07:06,265 INFO  L140   encePairwiseOnDemand]: 36/42 looper letters, 119 selfloop transitions, 9 changer transitions 0/131 dead transitions.
[2024-06-04 18:07:06,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 131 transitions, 1422 flow
[2024-06-04 18:07:06,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:07:06,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:07:06,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions.
[2024-06-04 18:07:06,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-04 18:07:06,266 INFO  L175             Difference]: Start difference. First operand has 109 places, 120 transitions, 1120 flow. Second operand 4 states and 71 transitions.
[2024-06-04 18:07:06,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 131 transitions, 1422 flow
[2024-06-04 18:07:06,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 131 transitions, 1317 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 18:07:06,294 INFO  L231             Difference]: Finished difference. Result has 108 places, 123 transitions, 1075 flow
[2024-06-04 18:07:06,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1075, PETRI_PLACES=108, PETRI_TRANSITIONS=123}
[2024-06-04 18:07:06,295 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-04 18:07:06,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 123 transitions, 1075 flow
[2024-06-04 18:07:06,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:06,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:06,295 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:06,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:07:06,295 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:06,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:06,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 1994201852, now seen corresponding path program 1 times
[2024-06-04 18:07:06,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:06,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171719772]
[2024-06-04 18:07:06,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:06,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:06,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:14,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:14,987 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:14,987 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171719772]
[2024-06-04 18:07:14,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171719772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:14,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:14,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:07:14,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503897729]
[2024-06-04 18:07:14,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:14,988 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:07:14,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:14,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:07:14,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:07:15,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:07:15,198 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 123 transitions, 1075 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:15,198 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:15,198 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:07:15,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:16,438 INFO  L124   PetriNetUnfolderBase]: 2065/3070 cut-off events.
[2024-06-04 18:07:16,438 INFO  L125   PetriNetUnfolderBase]: For 53565/53565 co-relation queries the response was YES.
[2024-06-04 18:07:16,445 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17626 conditions, 3070 events. 2065/3070 cut-off events. For 53565/53565 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14033 event pairs, 586 based on Foata normal form. 4/3074 useless extension candidates. Maximal degree in co-relation 17574. Up to 2951 conditions per place. 
[2024-06-04 18:07:16,453 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 142 selfloop transitions, 19 changer transitions 0/164 dead transitions.
[2024-06-04 18:07:16,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 1543 flow
[2024-06-04 18:07:16,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:16,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:16,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:07:16,456 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-04 18:07:16,456 INFO  L175             Difference]: Start difference. First operand has 108 places, 123 transitions, 1075 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:07:16,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 1543 flow
[2024-06-04 18:07:16,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 164 transitions, 1517 flow, removed 8 selfloop flow, removed 2 redundant places.
[2024-06-04 18:07:16,484 INFO  L231             Difference]: Finished difference. Result has 116 places, 132 transitions, 1183 flow
[2024-06-04 18:07:16,484 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1183, PETRI_PLACES=116, PETRI_TRANSITIONS=132}
[2024-06-04 18:07:16,484 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-04 18:07:16,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 132 transitions, 1183 flow
[2024-06-04 18:07:16,484 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:16,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:16,485 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:16,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:07:16,485 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:16,485 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:16,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -223540338, now seen corresponding path program 2 times
[2024-06-04 18:07:16,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:16,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828255674]
[2024-06-04 18:07:16,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:16,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:16,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:24,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:24,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:24,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828255674]
[2024-06-04 18:07:24,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828255674] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:24,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:24,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:07:24,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694101645]
[2024-06-04 18:07:24,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:24,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:07:24,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:24,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:07:24,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:07:24,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:07:24,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 132 transitions, 1183 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:24,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:24,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:07:24,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:26,364 INFO  L124   PetriNetUnfolderBase]: 2119/3148 cut-off events.
[2024-06-04 18:07:26,364 INFO  L125   PetriNetUnfolderBase]: For 60877/60877 co-relation queries the response was YES.
[2024-06-04 18:07:26,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18795 conditions, 3148 events. 2119/3148 cut-off events. For 60877/60877 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14396 event pairs, 574 based on Foata normal form. 4/3152 useless extension candidates. Maximal degree in co-relation 18739. Up to 2895 conditions per place. 
[2024-06-04 18:07:26,382 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 135 selfloop transitions, 35 changer transitions 0/173 dead transitions.
[2024-06-04 18:07:26,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 173 transitions, 1767 flow
[2024-06-04 18:07:26,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:26,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:26,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-04 18:07:26,385 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 18:07:26,385 INFO  L175             Difference]: Start difference. First operand has 116 places, 132 transitions, 1183 flow. Second operand 8 states and 140 transitions.
[2024-06-04 18:07:26,385 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 173 transitions, 1767 flow
[2024-06-04 18:07:26,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 173 transitions, 1719 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-04 18:07:26,421 INFO  L231             Difference]: Finished difference. Result has 122 places, 140 transitions, 1312 flow
[2024-06-04 18:07:26,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1312, PETRI_PLACES=122, PETRI_TRANSITIONS=140}
[2024-06-04 18:07:26,421 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places.
[2024-06-04 18:07:26,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 140 transitions, 1312 flow
[2024-06-04 18:07:26,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:26,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:26,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:26,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:07:26,422 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:26,422 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:26,422 INFO  L85        PathProgramCache]: Analyzing trace with hash -223534758, now seen corresponding path program 3 times
[2024-06-04 18:07:26,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:26,422 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752703709]
[2024-06-04 18:07:26,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:26,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:26,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:34,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:34,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:34,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752703709]
[2024-06-04 18:07:34,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752703709] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:34,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:34,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:07:34,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77293242]
[2024-06-04 18:07:34,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:34,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:07:34,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:34,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:07:34,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:07:35,087 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:07:35,088 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 140 transitions, 1312 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:35,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:35,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:07:35,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:36,406 INFO  L124   PetriNetUnfolderBase]: 2109/3134 cut-off events.
[2024-06-04 18:07:36,407 INFO  L125   PetriNetUnfolderBase]: For 66855/66855 co-relation queries the response was YES.
[2024-06-04 18:07:36,416 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19337 conditions, 3134 events. 2109/3134 cut-off events. For 66855/66855 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14332 event pairs, 567 based on Foata normal form. 4/3138 useless extension candidates. Maximal degree in co-relation 19278. Up to 2887 conditions per place. 
[2024-06-04 18:07:36,426 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 133 selfloop transitions, 37 changer transitions 0/173 dead transitions.
[2024-06-04 18:07:36,426 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 173 transitions, 1747 flow
[2024-06-04 18:07:36,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:36,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:36,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-04 18:07:36,429 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-04 18:07:36,429 INFO  L175             Difference]: Start difference. First operand has 122 places, 140 transitions, 1312 flow. Second operand 8 states and 138 transitions.
[2024-06-04 18:07:36,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 173 transitions, 1747 flow
[2024-06-04 18:07:36,476 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 173 transitions, 1633 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-04 18:07:36,478 INFO  L231             Difference]: Finished difference. Result has 125 places, 141 transitions, 1294 flow
[2024-06-04 18:07:36,478 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1294, PETRI_PLACES=125, PETRI_TRANSITIONS=141}
[2024-06-04 18:07:36,479 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-04 18:07:36,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 1294 flow
[2024-06-04 18:07:36,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:36,479 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:36,479 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:36,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:07:36,479 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:36,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:36,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 397518648, now seen corresponding path program 1 times
[2024-06-04 18:07:36,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:36,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304471741]
[2024-06-04 18:07:36,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:36,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:36,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:44,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:44,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:44,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304471741]
[2024-06-04 18:07:44,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304471741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:44,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:44,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:44,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747320560]
[2024-06-04 18:07:44,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:44,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:44,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:44,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:44,666 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:44,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:07:44,772 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 1294 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:44,772 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:44,772 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:07:44,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:46,047 INFO  L124   PetriNetUnfolderBase]: 2143/3192 cut-off events.
[2024-06-04 18:07:46,047 INFO  L125   PetriNetUnfolderBase]: For 72789/72799 co-relation queries the response was YES.
[2024-06-04 18:07:46,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 3192 events. 2143/3192 cut-off events. For 72789/72799 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14731 event pairs, 651 based on Foata normal form. 18/3210 useless extension candidates. Maximal degree in co-relation 19571. Up to 2865 conditions per place. 
[2024-06-04 18:07:46,065 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 121 selfloop transitions, 47 changer transitions 0/171 dead transitions.
[2024-06-04 18:07:46,065 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 171 transitions, 1728 flow
[2024-06-04 18:07:46,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:46,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:46,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:07:46,067 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-04 18:07:46,067 INFO  L175             Difference]: Start difference. First operand has 125 places, 141 transitions, 1294 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:07:46,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 171 transitions, 1728 flow
[2024-06-04 18:07:46,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 171 transitions, 1670 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-04 18:07:46,112 INFO  L231             Difference]: Finished difference. Result has 128 places, 143 transitions, 1367 flow
[2024-06-04 18:07:46,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1367, PETRI_PLACES=128, PETRI_TRANSITIONS=143}
[2024-06-04 18:07:46,113 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-04 18:07:46,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 143 transitions, 1367 flow
[2024-06-04 18:07:46,116 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:46,116 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:46,116 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:46,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:07:46,117 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:46,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:46,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -870987720, now seen corresponding path program 4 times
[2024-06-04 18:07:46,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:46,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018401777]
[2024-06-04 18:07:46,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:46,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:46,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:55,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:55,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:55,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018401777]
[2024-06-04 18:07:55,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018401777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:55,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:55,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:55,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042096626]
[2024-06-04 18:07:55,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:55,216 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:55,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:55,216 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:55,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:55,398 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:07:55,398 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 143 transitions, 1367 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:55,398 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:55,398 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:07:55,398 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:56,702 INFO  L124   PetriNetUnfolderBase]: 2187/3258 cut-off events.
[2024-06-04 18:07:56,702 INFO  L125   PetriNetUnfolderBase]: For 80470/80480 co-relation queries the response was YES.
[2024-06-04 18:07:56,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20475 conditions, 3258 events. 2187/3258 cut-off events. For 80470/80480 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15096 event pairs, 558 based on Foata normal form. 13/3271 useless extension candidates. Maximal degree in co-relation 20414. Up to 2669 conditions per place. 
[2024-06-04 18:07:56,723 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 124 selfloop transitions, 59 changer transitions 0/186 dead transitions.
[2024-06-04 18:07:56,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 2025 flow
[2024-06-04 18:07:56,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:56,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:56,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 18:07:56,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 18:07:56,726 INFO  L175             Difference]: Start difference. First operand has 128 places, 143 transitions, 1367 flow. Second operand 8 states and 144 transitions.
[2024-06-04 18:07:56,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 2025 flow
[2024-06-04 18:07:56,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 186 transitions, 1922 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-04 18:07:56,775 INFO  L231             Difference]: Finished difference. Result has 131 places, 153 transitions, 1525 flow
[2024-06-04 18:07:56,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1525, PETRI_PLACES=131, PETRI_TRANSITIONS=153}
[2024-06-04 18:07:56,776 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-04 18:07:56,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 153 transitions, 1525 flow
[2024-06-04 18:07:56,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:56,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:56,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:56,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:07:56,776 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:56,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:56,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1127690040, now seen corresponding path program 5 times
[2024-06-04 18:07:56,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:56,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863951395]
[2024-06-04 18:07:56,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:56,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:56,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:05,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:05,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:05,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863951395]
[2024-06-04 18:08:05,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863951395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:05,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:05,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:05,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936469408]
[2024-06-04 18:08:05,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:05,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:05,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:05,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:05,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:05,206 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:08:05,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 153 transitions, 1525 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:05,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:05,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:08:05,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:06,502 INFO  L124   PetriNetUnfolderBase]: 2209/3290 cut-off events.
[2024-06-04 18:08:06,502 INFO  L125   PetriNetUnfolderBase]: For 87784/87794 co-relation queries the response was YES.
[2024-06-04 18:08:06,558 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21524 conditions, 3290 events. 2209/3290 cut-off events. For 87784/87794 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15265 event pairs, 559 based on Foata normal form. 9/3299 useless extension candidates. Maximal degree in co-relation 21461. Up to 2678 conditions per place. 
[2024-06-04 18:08:06,568 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 130 selfloop transitions, 61 changer transitions 0/194 dead transitions.
[2024-06-04 18:08:06,568 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 194 transitions, 2287 flow
[2024-06-04 18:08:06,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:06,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:06,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-04 18:08:06,570 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-04 18:08:06,570 INFO  L175             Difference]: Start difference. First operand has 131 places, 153 transitions, 1525 flow. Second operand 8 states and 148 transitions.
[2024-06-04 18:08:06,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 194 transitions, 2287 flow
[2024-06-04 18:08:06,618 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 194 transitions, 2221 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-04 18:08:06,621 INFO  L231             Difference]: Finished difference. Result has 136 places, 159 transitions, 1687 flow
[2024-06-04 18:08:06,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1687, PETRI_PLACES=136, PETRI_TRANSITIONS=159}
[2024-06-04 18:08:06,622 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-04 18:08:06,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 159 transitions, 1687 flow
[2024-06-04 18:08:06,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:06,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:06,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:06,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:08:06,622 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:06,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:06,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -1127695620, now seen corresponding path program 6 times
[2024-06-04 18:08:06,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:06,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16412127]
[2024-06-04 18:08:06,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:06,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:06,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:16,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:16,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:16,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16412127]
[2024-06-04 18:08:16,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16412127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:16,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:16,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:16,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822858932]
[2024-06-04 18:08:16,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:16,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:16,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:16,533 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:16,533 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:16,702 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:08:16,702 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 159 transitions, 1687 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:16,702 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:16,702 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:08:16,702 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:18,026 INFO  L124   PetriNetUnfolderBase]: 2199/3276 cut-off events.
[2024-06-04 18:08:18,026 INFO  L125   PetriNetUnfolderBase]: For 93163/93173 co-relation queries the response was YES.
[2024-06-04 18:08:18,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21841 conditions, 3276 events. 2199/3276 cut-off events. For 93163/93173 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15211 event pairs, 579 based on Foata normal form. 9/3285 useless extension candidates. Maximal degree in co-relation 21776. Up to 2869 conditions per place. 
[2024-06-04 18:08:18,047 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 132 selfloop transitions, 55 changer transitions 0/190 dead transitions.
[2024-06-04 18:08:18,047 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 190 transitions, 2149 flow
[2024-06-04 18:08:18,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:18,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:18,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-04 18:08:18,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-04 18:08:18,049 INFO  L175             Difference]: Start difference. First operand has 136 places, 159 transitions, 1687 flow. Second operand 8 states and 139 transitions.
[2024-06-04 18:08:18,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 190 transitions, 2149 flow
[2024-06-04 18:08:18,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 190 transitions, 2063 flow, removed 37 selfloop flow, removed 2 redundant places.
[2024-06-04 18:08:18,121 INFO  L231             Difference]: Finished difference. Result has 143 places, 161 transitions, 1749 flow
[2024-06-04 18:08:18,122 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1749, PETRI_PLACES=143, PETRI_TRANSITIONS=161}
[2024-06-04 18:08:18,122 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places.
[2024-06-04 18:08:18,122 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 161 transitions, 1749 flow
[2024-06-04 18:08:18,122 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:18,122 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:18,123 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:18,123 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:08:18,123 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:18,123 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:18,123 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667117434, now seen corresponding path program 2 times
[2024-06-04 18:08:18,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:18,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228989826]
[2024-06-04 18:08:18,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:18,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:18,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:26,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:26,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:26,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228989826]
[2024-06-04 18:08:26,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228989826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:26,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:26,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:08:26,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210259409]
[2024-06-04 18:08:26,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:26,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:08:26,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:26,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:08:26,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:08:27,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:08:27,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 161 transitions, 1749 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:27,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:27,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:08:27,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:28,762 INFO  L124   PetriNetUnfolderBase]: 2233/3328 cut-off events.
[2024-06-04 18:08:28,762 INFO  L125   PetriNetUnfolderBase]: For 100092/100102 co-relation queries the response was YES.
[2024-06-04 18:08:28,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22434 conditions, 3328 events. 2233/3328 cut-off events. For 100092/100102 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15574 event pairs, 624 based on Foata normal form. 18/3346 useless extension candidates. Maximal degree in co-relation 22366. Up to 2875 conditions per place. 
[2024-06-04 18:08:28,783 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 145 selfloop transitions, 53 changer transitions 0/201 dead transitions.
[2024-06-04 18:08:28,783 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 201 transitions, 2403 flow
[2024-06-04 18:08:28,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:08:28,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:08:28,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-04 18:08:28,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4021164021164021
[2024-06-04 18:08:28,785 INFO  L175             Difference]: Start difference. First operand has 143 places, 161 transitions, 1749 flow. Second operand 9 states and 152 transitions.
[2024-06-04 18:08:28,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 201 transitions, 2403 flow
[2024-06-04 18:08:28,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 201 transitions, 2305 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-04 18:08:28,862 INFO  L231             Difference]: Finished difference. Result has 147 places, 165 transitions, 1824 flow
[2024-06-04 18:08:28,862 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1824, PETRI_PLACES=147, PETRI_TRANSITIONS=165}
[2024-06-04 18:08:28,863 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-04 18:08:28,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 165 transitions, 1824 flow
[2024-06-04 18:08:28,863 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:28,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:28,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:28,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:08:28,864 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:28,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:28,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667108134, now seen corresponding path program 3 times
[2024-06-04 18:08:28,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:28,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066309561]
[2024-06-04 18:08:28,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:28,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:28,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:37,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:37,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:37,211 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066309561]
[2024-06-04 18:08:37,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066309561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:37,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:37,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:37,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038723203]
[2024-06-04 18:08:37,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:37,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:37,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:37,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:37,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:37,348 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:08:37,348 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 165 transitions, 1824 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:37,348 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:37,348 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:08:37,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:38,725 INFO  L124   PetriNetUnfolderBase]: 2217/3304 cut-off events.
[2024-06-04 18:08:38,726 INFO  L125   PetriNetUnfolderBase]: For 104513/104523 co-relation queries the response was YES.
[2024-06-04 18:08:38,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22503 conditions, 3304 events. 2217/3304 cut-off events. For 104513/104523 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15417 event pairs, 675 based on Foata normal form. 18/3322 useless extension candidates. Maximal degree in co-relation 22434. Up to 2987 conditions per place. 
[2024-06-04 18:08:38,804 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 145 selfloop transitions, 45 changer transitions 0/193 dead transitions.
[2024-06-04 18:08:38,804 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 193 transitions, 2280 flow
[2024-06-04 18:08:38,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:38,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:38,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:08:38,806 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-04 18:08:38,807 INFO  L175             Difference]: Start difference. First operand has 147 places, 165 transitions, 1824 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:08:38,807 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 193 transitions, 2280 flow
[2024-06-04 18:08:38,876 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 193 transitions, 2174 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-04 18:08:38,878 INFO  L231             Difference]: Finished difference. Result has 150 places, 165 transitions, 1815 flow
[2024-06-04 18:08:38,878 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1815, PETRI_PLACES=150, PETRI_TRANSITIONS=165}
[2024-06-04 18:08:38,878 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-04 18:08:38,879 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 165 transitions, 1815 flow
[2024-06-04 18:08:38,879 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:38,879 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:38,879 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:38,879 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:08:38,879 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:38,879 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:38,880 INFO  L85        PathProgramCache]: Analyzing trace with hash 958573540, now seen corresponding path program 1 times
[2024-06-04 18:08:38,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:38,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246163964]
[2024-06-04 18:08:38,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:38,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:38,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:48,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:48,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:48,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246163964]
[2024-06-04 18:08:48,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246163964] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:48,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:48,395 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:08:48,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756271310]
[2024-06-04 18:08:48,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:48,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:08:48,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:48,396 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:08:48,396 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:08:48,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:08:48,614 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 165 transitions, 1815 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:48,614 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:48,614 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:08:48,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:50,097 INFO  L124   PetriNetUnfolderBase]: 2254/3395 cut-off events.
[2024-06-04 18:08:50,097 INFO  L125   PetriNetUnfolderBase]: For 118395/118443 co-relation queries the response was YES.
[2024-06-04 18:08:50,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23571 conditions, 3395 events. 2254/3395 cut-off events. For 118395/118443 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16238 event pairs, 527 based on Foata normal form. 10/3327 useless extension candidates. Maximal degree in co-relation 23501. Up to 3081 conditions per place. 
[2024-06-04 18:08:50,123 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 149 selfloop transitions, 42 changer transitions 0/227 dead transitions.
[2024-06-04 18:08:50,123 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 227 transitions, 2557 flow
[2024-06-04 18:08:50,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:08:50,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:08:50,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-04 18:08:50,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-04 18:08:50,125 INFO  L175             Difference]: Start difference. First operand has 150 places, 165 transitions, 1815 flow. Second operand 9 states and 160 transitions.
[2024-06-04 18:08:50,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 227 transitions, 2557 flow
[2024-06-04 18:08:50,220 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 227 transitions, 2448 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-04 18:08:50,223 INFO  L231             Difference]: Finished difference. Result has 155 places, 189 transitions, 2097 flow
[2024-06-04 18:08:50,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2097, PETRI_PLACES=155, PETRI_TRANSITIONS=189}
[2024-06-04 18:08:50,224 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places.
[2024-06-04 18:08:50,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 189 transitions, 2097 flow
[2024-06-04 18:08:50,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:50,224 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:50,224 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:50,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:08:50,224 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:50,224 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:50,224 INFO  L85        PathProgramCache]: Analyzing trace with hash 1687854706, now seen corresponding path program 2 times
[2024-06-04 18:08:50,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:50,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85069142]
[2024-06-04 18:08:50,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:50,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:50,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:59,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:59,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:59,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85069142]
[2024-06-04 18:08:59,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85069142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:59,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:59,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:08:59,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373184826]
[2024-06-04 18:08:59,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:59,725 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:08:59,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:59,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:08:59,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:08:59,978 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:08:59,978 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 189 transitions, 2097 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:59,978 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:59,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:08:59,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:01,533 INFO  L124   PetriNetUnfolderBase]: 2258/3409 cut-off events.
[2024-06-04 18:09:01,533 INFO  L125   PetriNetUnfolderBase]: For 124579/124636 co-relation queries the response was YES.
[2024-06-04 18:09:01,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24149 conditions, 3409 events. 2258/3409 cut-off events. For 124579/124636 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16346 event pairs, 398 based on Foata normal form. 24/3361 useless extension candidates. Maximal degree in co-relation 24075. Up to 3030 conditions per place. 
[2024-06-04 18:09:01,559 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 141 selfloop transitions, 46 changer transitions 0/223 dead transitions.
[2024-06-04 18:09:01,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 223 transitions, 2609 flow
[2024-06-04 18:09:01,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:09:01,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:09:01,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-04 18:09:01,562 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 18:09:01,562 INFO  L175             Difference]: Start difference. First operand has 155 places, 189 transitions, 2097 flow. Second operand 8 states and 140 transitions.
[2024-06-04 18:09:01,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 223 transitions, 2609 flow
[2024-06-04 18:09:01,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 223 transitions, 2539 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-04 18:09:01,657 INFO  L231             Difference]: Finished difference. Result has 160 places, 191 transitions, 2171 flow
[2024-06-04 18:09:01,658 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2171, PETRI_PLACES=160, PETRI_TRANSITIONS=191}
[2024-06-04 18:09:01,658 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places.
[2024-06-04 18:09:01,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 191 transitions, 2171 flow
[2024-06-04 18:09:01,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:01,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:01,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:01,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:09:01,659 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:01,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:01,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 1690596346, now seen corresponding path program 3 times
[2024-06-04 18:09:01,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:01,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928324319]
[2024-06-04 18:09:01,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:01,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:01,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:10,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:10,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:10,326 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928324319]
[2024-06-04 18:09:10,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928324319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:10,326 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:10,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:10,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388273047]
[2024-06-04 18:09:10,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:10,327 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:10,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:10,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:10,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:10,526 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:09:10,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 191 transitions, 2171 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:10,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:10,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:09:10,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:12,095 INFO  L124   PetriNetUnfolderBase]: 2275/3438 cut-off events.
[2024-06-04 18:09:12,095 INFO  L125   PetriNetUnfolderBase]: For 134046/134112 co-relation queries the response was YES.
[2024-06-04 18:09:12,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24792 conditions, 3438 events. 2275/3438 cut-off events. For 134046/134112 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16570 event pairs, 515 based on Foata normal form. 15/3379 useless extension candidates. Maximal degree in co-relation 24717. Up to 3092 conditions per place. 
[2024-06-04 18:09:12,120 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 144 selfloop transitions, 45 changer transitions 0/225 dead transitions.
[2024-06-04 18:09:12,121 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 225 transitions, 2691 flow
[2024-06-04 18:09:12,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:09:12,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:09:12,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-04 18:09:12,122 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-04 18:09:12,122 INFO  L175             Difference]: Start difference. First operand has 160 places, 191 transitions, 2171 flow. Second operand 8 states and 141 transitions.
[2024-06-04 18:09:12,122 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 225 transitions, 2691 flow
[2024-06-04 18:09:12,216 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 225 transitions, 2563 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-04 18:09:12,219 INFO  L231             Difference]: Finished difference. Result has 162 places, 193 transitions, 2187 flow
[2024-06-04 18:09:12,219 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2187, PETRI_PLACES=162, PETRI_TRANSITIONS=193}
[2024-06-04 18:09:12,220 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-04 18:09:12,220 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 193 transitions, 2187 flow
[2024-06-04 18:09:12,220 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:12,220 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:12,220 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:12,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:09:12,220 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:12,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:12,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 1690716626, now seen corresponding path program 1 times
[2024-06-04 18:09:12,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:12,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812634720]
[2024-06-04 18:09:12,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:12,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:12,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:21,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:21,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:21,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812634720]
[2024-06-04 18:09:21,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812634720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:21,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:21,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:21,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763260243]
[2024-06-04 18:09:21,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:21,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:21,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:21,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:21,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:21,784 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:09:21,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 193 transitions, 2187 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:21,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:21,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:09:21,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:23,387 INFO  L124   PetriNetUnfolderBase]: 2442/3649 cut-off events.
[2024-06-04 18:09:23,387 INFO  L125   PetriNetUnfolderBase]: For 126895/126897 co-relation queries the response was YES.
[2024-06-04 18:09:23,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25488 conditions, 3649 events. 2442/3649 cut-off events. For 126895/126897 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17346 event pairs, 569 based on Foata normal form. 6/3655 useless extension candidates. Maximal degree in co-relation 25412. Up to 3425 conditions per place. 
[2024-06-04 18:09:23,412 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 201 selfloop transitions, 29 changer transitions 0/233 dead transitions.
[2024-06-04 18:09:23,412 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 233 transitions, 2805 flow
[2024-06-04 18:09:23,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:23,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:23,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-04 18:09:23,414 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-04 18:09:23,414 INFO  L175             Difference]: Start difference. First operand has 162 places, 193 transitions, 2187 flow. Second operand 9 states and 150 transitions.
[2024-06-04 18:09:23,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 233 transitions, 2805 flow
[2024-06-04 18:09:23,526 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 233 transitions, 2685 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-04 18:09:23,529 INFO  L231             Difference]: Finished difference. Result has 165 places, 196 transitions, 2183 flow
[2024-06-04 18:09:23,529 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2183, PETRI_PLACES=165, PETRI_TRANSITIONS=196}
[2024-06-04 18:09:23,529 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-04 18:09:23,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 196 transitions, 2183 flow
[2024-06-04 18:09:23,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:23,530 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:23,530 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:23,530 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:09:23,530 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:23,530 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:23,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -38632186, now seen corresponding path program 4 times
[2024-06-04 18:09:23,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:23,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458152959]
[2024-06-04 18:09:23,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:23,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:23,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:35,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:35,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:35,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458152959]
[2024-06-04 18:09:35,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458152959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:35,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:35,256 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:09:35,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355534621]
[2024-06-04 18:09:35,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:35,256 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:09:35,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:35,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:09:35,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:09:35,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:09:35,430 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 196 transitions, 2183 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:35,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:35,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:09:35,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:36,911 INFO  L124   PetriNetUnfolderBase]: 2317/3505 cut-off events.
[2024-06-04 18:09:36,912 INFO  L125   PetriNetUnfolderBase]: For 142791/142855 co-relation queries the response was YES.
[2024-06-04 18:09:36,924 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25239 conditions, 3505 events. 2317/3505 cut-off events. For 142791/142855 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16974 event pairs, 502 based on Foata normal form. 15/3443 useless extension candidates. Maximal degree in co-relation 25162. Up to 3078 conditions per place. 
[2024-06-04 18:09:36,938 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 135 selfloop transitions, 56 changer transitions 0/228 dead transitions.
[2024-06-04 18:09:36,938 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 228 transitions, 2695 flow
[2024-06-04 18:09:36,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:09:36,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:09:36,939 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:09:36,939 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-04 18:09:36,939 INFO  L175             Difference]: Start difference. First operand has 165 places, 196 transitions, 2183 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:09:36,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 228 transitions, 2695 flow
[2024-06-04 18:09:37,034 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 228 transitions, 2615 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-04 18:09:37,037 INFO  L231             Difference]: Finished difference. Result has 166 places, 198 transitions, 2269 flow
[2024-06-04 18:09:37,037 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2269, PETRI_PLACES=166, PETRI_TRANSITIONS=198}
[2024-06-04 18:09:37,037 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-04 18:09:37,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 198 transitions, 2269 flow
[2024-06-04 18:09:37,037 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:37,037 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:37,037 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:37,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:09:37,037 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:37,038 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:37,038 INFO  L85        PathProgramCache]: Analyzing trace with hash -38627226, now seen corresponding path program 2 times
[2024-06-04 18:09:37,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:37,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052066930]
[2024-06-04 18:09:37,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:37,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:37,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:45,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:45,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:45,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052066930]
[2024-06-04 18:09:45,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052066930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:45,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:45,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:09:45,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814752694]
[2024-06-04 18:09:45,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:45,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:09:45,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:45,744 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:09:45,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:09:45,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:09:45,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 198 transitions, 2269 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-04 18:09:45,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:45,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:09:45,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:47,819 INFO  L124   PetriNetUnfolderBase]: 2489/3721 cut-off events.
[2024-06-04 18:09:47,819 INFO  L125   PetriNetUnfolderBase]: For 142956/142956 co-relation queries the response was YES.
[2024-06-04 18:09:47,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26527 conditions, 3721 events. 2489/3721 cut-off events. For 142956/142956 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 17755 event pairs, 558 based on Foata normal form. 4/3725 useless extension candidates. Maximal degree in co-relation 26449. Up to 3358 conditions per place. 
[2024-06-04 18:09:47,849 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 188 selfloop transitions, 45 changer transitions 0/236 dead transitions.
[2024-06-04 18:09:47,849 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 236 transitions, 2887 flow
[2024-06-04 18:09:47,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:47,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:47,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-04 18:09:47,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 18:09:47,852 INFO  L175             Difference]: Start difference. First operand has 166 places, 198 transitions, 2269 flow. Second operand 9 states and 153 transitions.
[2024-06-04 18:09:47,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 236 transitions, 2887 flow
[2024-06-04 18:09:47,973 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 236 transitions, 2741 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-04 18:09:47,976 INFO  L231             Difference]: Finished difference. Result has 169 places, 201 transitions, 2277 flow
[2024-06-04 18:09:47,977 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2277, PETRI_PLACES=169, PETRI_TRANSITIONS=201}
[2024-06-04 18:09:47,977 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places.
[2024-06-04 18:09:47,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 201 transitions, 2277 flow
[2024-06-04 18:09:47,977 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-04 18:09:47,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:47,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:47,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:09:47,978 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:47,978 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:47,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -38447736, now seen corresponding path program 3 times
[2024-06-04 18:09:47,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:47,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748612503]
[2024-06-04 18:09:47,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:47,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:48,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:56,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:56,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:56,742 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748612503]
[2024-06-04 18:09:56,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748612503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:56,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:56,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:09:56,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285884960]
[2024-06-04 18:09:56,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:56,743 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:09:56,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:56,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:09:56,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:09:57,006 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:09:57,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 201 transitions, 2277 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-04 18:09:57,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:57,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:09:57,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:58,511 INFO  L124   PetriNetUnfolderBase]: 2554/3815 cut-off events.
[2024-06-04 18:09:58,511 INFO  L125   PetriNetUnfolderBase]: For 153078/153078 co-relation queries the response was YES.
[2024-06-04 18:09:58,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27425 conditions, 3815 events. 2554/3815 cut-off events. For 153078/153078 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18238 event pairs, 560 based on Foata normal form. 4/3819 useless extension candidates. Maximal degree in co-relation 27346. Up to 3345 conditions per place. 
[2024-06-04 18:09:58,541 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 187 selfloop transitions, 59 changer transitions 0/249 dead transitions.
[2024-06-04 18:09:58,541 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 249 transitions, 3169 flow
[2024-06-04 18:09:58,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:58,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:58,544 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-04 18:09:58,544 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41534391534391535
[2024-06-04 18:09:58,544 INFO  L175             Difference]: Start difference. First operand has 169 places, 201 transitions, 2277 flow. Second operand 9 states and 157 transitions.
[2024-06-04 18:09:58,544 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 249 transitions, 3169 flow
[2024-06-04 18:09:58,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 249 transitions, 3051 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-04 18:09:58,667 INFO  L231             Difference]: Finished difference. Result has 172 places, 210 transitions, 2470 flow
[2024-06-04 18:09:58,667 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2470, PETRI_PLACES=172, PETRI_TRANSITIONS=210}
[2024-06-04 18:09:58,668 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-04 18:09:58,668 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 210 transitions, 2470 flow
[2024-06-04 18:09:58,668 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-04 18:09:58,668 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:58,668 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:58,668 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:09:58,668 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:58,669 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:58,669 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660358452, now seen corresponding path program 4 times
[2024-06-04 18:09:58,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:58,669 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318265260]
[2024-06-04 18:09:58,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:58,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:58,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:07,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:07,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:07,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318265260]
[2024-06-04 18:10:07,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318265260] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:07,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:07,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:10:07,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521040427]
[2024-06-04 18:10:07,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:07,620 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:10:07,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:07,620 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:10:07,620 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:10:07,864 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:10:07,865 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 210 transitions, 2470 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-04 18:10:07,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:07,865 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:10:07,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:09,630 INFO  L124   PetriNetUnfolderBase]: 2544/3801 cut-off events.
[2024-06-04 18:10:09,631 INFO  L125   PetriNetUnfolderBase]: For 158441/158441 co-relation queries the response was YES.
[2024-06-04 18:10:09,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27598 conditions, 3801 events. 2544/3801 cut-off events. For 158441/158441 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18175 event pairs, 560 based on Foata normal form. 4/3805 useless extension candidates. Maximal degree in co-relation 27517. Up to 3438 conditions per place. 
[2024-06-04 18:10:09,660 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 46 changer transitions 0/246 dead transitions.
[2024-06-04 18:10:09,660 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 246 transitions, 3062 flow
[2024-06-04 18:10:09,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:10:09,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:10:09,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-04 18:10:09,663 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 18:10:09,663 INFO  L175             Difference]: Start difference. First operand has 172 places, 210 transitions, 2470 flow. Second operand 9 states and 153 transitions.
[2024-06-04 18:10:09,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 246 transitions, 3062 flow
[2024-06-04 18:10:09,802 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 246 transitions, 2938 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-04 18:10:09,805 INFO  L231             Difference]: Finished difference. Result has 176 places, 210 transitions, 2446 flow
[2024-06-04 18:10:09,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2446, PETRI_PLACES=176, PETRI_TRANSITIONS=210}
[2024-06-04 18:10:09,805 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 133 predicate places.
[2024-06-04 18:10:09,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 210 transitions, 2446 flow
[2024-06-04 18:10:09,805 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-04 18:10:09,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:09,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:09,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:10:09,806 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:09,806 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:09,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044554689, now seen corresponding path program 1 times
[2024-06-04 18:10:09,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:09,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792236158]
[2024-06-04 18:10:09,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:09,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:09,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:20,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:20,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:20,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792236158]
[2024-06-04 18:10:20,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792236158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:20,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:20,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:20,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305629596]
[2024-06-04 18:10:20,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:20,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:20,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:20,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:20,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:20,427 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:10:20,428 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 210 transitions, 2446 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:20,428 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:20,428 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:10:20,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:21,943 INFO  L124   PetriNetUnfolderBase]: 2574/3842 cut-off events.
[2024-06-04 18:10:21,944 INFO  L125   PetriNetUnfolderBase]: For 165008/165010 co-relation queries the response was YES.
[2024-06-04 18:10:21,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28052 conditions, 3842 events. 2574/3842 cut-off events. For 165008/165010 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 18363 event pairs, 702 based on Foata normal form. 6/3848 useless extension candidates. Maximal degree in co-relation 27969. Up to 3696 conditions per place. 
[2024-06-04 18:10:21,972 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 206 selfloop transitions, 36 changer transitions 0/245 dead transitions.
[2024-06-04 18:10:21,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 245 transitions, 3207 flow
[2024-06-04 18:10:21,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:21,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:21,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-04 18:10:21,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4013605442176871
[2024-06-04 18:10:21,974 INFO  L175             Difference]: Start difference. First operand has 176 places, 210 transitions, 2446 flow. Second operand 7 states and 118 transitions.
[2024-06-04 18:10:21,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 245 transitions, 3207 flow
[2024-06-04 18:10:22,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 245 transitions, 3103 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-04 18:10:22,134 INFO  L231             Difference]: Finished difference. Result has 177 places, 221 transitions, 2571 flow
[2024-06-04 18:10:22,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2571, PETRI_PLACES=177, PETRI_TRANSITIONS=221}
[2024-06-04 18:10:22,135 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-04 18:10:22,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 221 transitions, 2571 flow
[2024-06-04 18:10:22,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:22,135 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:22,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:22,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:10:22,135 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:22,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:22,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 487384806, now seen corresponding path program 5 times
[2024-06-04 18:10:22,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:22,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570517121]
[2024-06-04 18:10:22,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:22,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:22,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:31,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:31,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:31,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570517121]
[2024-06-04 18:10:31,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570517121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:31,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:31,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:10:31,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188070086]
[2024-06-04 18:10:31,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:31,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:10:31,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:31,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:10:31,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:10:32,120 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:10:32,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 221 transitions, 2571 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:32,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:32,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:10:32,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:33,630 INFO  L124   PetriNetUnfolderBase]: 2416/3652 cut-off events.
[2024-06-04 18:10:33,630 INFO  L125   PetriNetUnfolderBase]: For 181499/181571 co-relation queries the response was YES.
[2024-06-04 18:10:33,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27483 conditions, 3652 events. 2416/3652 cut-off events. For 181499/181571 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17721 event pairs, 523 based on Foata normal form. 19/3588 useless extension candidates. Maximal degree in co-relation 27398. Up to 3145 conditions per place. 
[2024-06-04 18:10:33,655 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 69 changer transitions 0/252 dead transitions.
[2024-06-04 18:10:33,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 252 transitions, 3125 flow
[2024-06-04 18:10:33,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:33,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:33,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:10:33,657 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-04 18:10:33,657 INFO  L175             Difference]: Start difference. First operand has 177 places, 221 transitions, 2571 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:10:33,657 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 252 transitions, 3125 flow
[2024-06-04 18:10:33,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 252 transitions, 3079 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-04 18:10:33,807 INFO  L231             Difference]: Finished difference. Result has 183 places, 223 transitions, 2721 flow
[2024-06-04 18:10:33,807 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2525, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2721, PETRI_PLACES=183, PETRI_TRANSITIONS=223}
[2024-06-04 18:10:33,808 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places.
[2024-06-04 18:10:33,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 223 transitions, 2721 flow
[2024-06-04 18:10:33,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:33,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:33,808 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:33,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:10:33,809 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:33,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:33,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -144593416, now seen corresponding path program 5 times
[2024-06-04 18:10:33,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:33,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957314215]
[2024-06-04 18:10:33,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:33,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:33,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:43,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:43,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:43,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957314215]
[2024-06-04 18:10:43,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957314215] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:43,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:43,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:10:43,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967318543]
[2024-06-04 18:10:43,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:43,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:10:43,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:43,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:10:43,138 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:10:43,332 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:10:43,333 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 223 transitions, 2721 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-04 18:10:43,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:43,333 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:10:43,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:45,155 INFO  L124   PetriNetUnfolderBase]: 2583/3862 cut-off events.
[2024-06-04 18:10:45,155 INFO  L125   PetriNetUnfolderBase]: For 180467/180479 co-relation queries the response was YES.
[2024-06-04 18:10:45,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28903 conditions, 3862 events. 2583/3862 cut-off events. For 180467/180479 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18494 event pairs, 558 based on Foata normal form. 10/3872 useless extension candidates. Maximal degree in co-relation 28816. Up to 3129 conditions per place. 
[2024-06-04 18:10:45,183 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 169 selfloop transitions, 93 changer transitions 0/265 dead transitions.
[2024-06-04 18:10:45,183 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 265 transitions, 3569 flow
[2024-06-04 18:10:45,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:10:45,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:10:45,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-04 18:10:45,186 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42592592592592593
[2024-06-04 18:10:45,186 INFO  L175             Difference]: Start difference. First operand has 183 places, 223 transitions, 2721 flow. Second operand 9 states and 161 transitions.
[2024-06-04 18:10:45,186 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 265 transitions, 3569 flow
[2024-06-04 18:10:45,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 265 transitions, 3393 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:45,355 INFO  L231             Difference]: Finished difference. Result has 186 places, 226 transitions, 2806 flow
[2024-06-04 18:10:45,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2806, PETRI_PLACES=186, PETRI_TRANSITIONS=226}
[2024-06-04 18:10:45,355 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-04 18:10:45,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 226 transitions, 2806 flow
[2024-06-04 18:10:45,356 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-04 18:10:45,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:45,356 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:45,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:10:45,356 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-04 18:10:45,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:45,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 487562746, now seen corresponding path program 6 times
[2024-06-04 18:10:45,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:45,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357690322]
[2024-06-04 18:10:45,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:45,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:45,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:55,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:55,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:55,053 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357690322]
[2024-06-04 18:10:55,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357690322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:55,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:55,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:10:55,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417845758]
[2024-06-04 18:10:55,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:55,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:10:55,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:55,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:10:55,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:10:55,240 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:10:55,240 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 226 transitions, 2806 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:55,240 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:55,240 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:10:55,240 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:56,870 INFO  L124   PetriNetUnfolderBase]: 2605/3894 cut-off events.
[2024-06-04 18:10:56,870 INFO  L125   PetriNetUnfolderBase]: For 188573/188585 co-relation queries the response was YES.
[2024-06-04 18:10:56,886 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29512 conditions, 3894 events. 2605/3894 cut-off events. For 188573/188585 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18667 event pairs, 568 based on Foata normal form. 10/3904 useless extension candidates. Maximal degree in co-relation 29424. Up to 3371 conditions per place. 
[2024-06-04 18:10:56,900 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 199 selfloop transitions, 63 changer transitions 0/265 dead transitions.
[2024-06-04 18:10:56,900 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 265 transitions, 3504 flow
[2024-06-04 18:10:56,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:10:56,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:10:56,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-04 18:10:56,902 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41534391534391535
[2024-06-04 18:10:56,902 INFO  L175             Difference]: Start difference. First operand has 186 places, 226 transitions, 2806 flow. Second operand 9 states and 157 transitions.
[2024-06-04 18:10:56,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 265 transitions, 3504 flow
[2024-06-04 18:10:57,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 265 transitions, 3195 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-04 18:10:57,069 INFO  L231             Difference]: Finished difference. Result has 187 places, 229 transitions, 2705 flow
[2024-06-04 18:10:57,069 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2705, PETRI_PLACES=187, PETRI_TRANSITIONS=229}
[2024-06-04 18:10:57,069 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places.
[2024-06-04 18:10:57,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 229 transitions, 2705 flow
[2024-06-04 18:10:57,070 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:57,070 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:57,070 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:57,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:10:57,070 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:57,070 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:57,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -144599926, now seen corresponding path program 7 times
[2024-06-04 18:10:57,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:57,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884407300]
[2024-06-04 18:10:57,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:57,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:57,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:06,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:06,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:06,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884407300]
[2024-06-04 18:11:06,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884407300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:06,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:06,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:06,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194905470]
[2024-06-04 18:11:06,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:06,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:06,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:06,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:06,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:06,755 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:11:06,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 229 transitions, 2705 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:06,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:06,755 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:11:06,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:08,326 INFO  L124   PetriNetUnfolderBase]: 2627/3926 cut-off events.
[2024-06-04 18:11:08,326 INFO  L125   PetriNetUnfolderBase]: For 187433/187445 co-relation queries the response was YES.
[2024-06-04 18:11:08,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29375 conditions, 3926 events. 2627/3926 cut-off events. For 187433/187445 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18817 event pairs, 558 based on Foata normal form. 10/3936 useless extension candidates. Maximal degree in co-relation 29287. Up to 3403 conditions per place. 
[2024-06-04 18:11:08,353 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 67 changer transitions 0/267 dead transitions.
[2024-06-04 18:11:08,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 267 transitions, 3398 flow
[2024-06-04 18:11:08,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:08,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:08,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-04 18:11:08,356 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4074074074074074
[2024-06-04 18:11:08,356 INFO  L175             Difference]: Start difference. First operand has 187 places, 229 transitions, 2705 flow. Second operand 9 states and 154 transitions.
[2024-06-04 18:11:08,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 267 transitions, 3398 flow
[2024-06-04 18:11:08,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 267 transitions, 3230 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-04 18:11:08,511 INFO  L231             Difference]: Finished difference. Result has 189 places, 232 transitions, 2746 flow
[2024-06-04 18:11:08,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2746, PETRI_PLACES=189, PETRI_TRANSITIONS=232}
[2024-06-04 18:11:08,511 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-04 18:11:08,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 232 transitions, 2746 flow
[2024-06-04 18:11:08,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:08,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:08,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:08,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:11:08,512 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:08,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:08,512 INFO  L85        PathProgramCache]: Analyzing trace with hash 487389766, now seen corresponding path program 8 times
[2024-06-04 18:11:08,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:08,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72166815]
[2024-06-04 18:11:08,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:08,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:08,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:18,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:18,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:18,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72166815]
[2024-06-04 18:11:18,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72166815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:18,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:18,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:18,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166855075]
[2024-06-04 18:11:18,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:18,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:18,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:18,036 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:18,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:18,230 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:11:18,230 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 232 transitions, 2746 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:18,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:18,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:11:18,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:19,968 INFO  L124   PetriNetUnfolderBase]: 2617/3912 cut-off events.
[2024-06-04 18:11:19,968 INFO  L125   PetriNetUnfolderBase]: For 192695/192707 co-relation queries the response was YES.
[2024-06-04 18:11:19,983 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29300 conditions, 3912 events. 2617/3912 cut-off events. For 192695/192707 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 18778 event pairs, 573 based on Foata normal form. 10/3922 useless extension candidates. Maximal degree in co-relation 29211. Up to 3389 conditions per place. 
[2024-06-04 18:11:19,997 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 199 selfloop transitions, 64 changer transitions 0/266 dead transitions.
[2024-06-04 18:11:19,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 266 transitions, 3372 flow
[2024-06-04 18:11:19,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:19,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:19,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-04 18:11:19,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4074074074074074
[2024-06-04 18:11:19,999 INFO  L175             Difference]: Start difference. First operand has 189 places, 232 transitions, 2746 flow. Second operand 9 states and 154 transitions.
[2024-06-04 18:11:19,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 266 transitions, 3372 flow
[2024-06-04 18:11:20,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 266 transitions, 3166 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-04 18:11:20,179 INFO  L231             Difference]: Finished difference. Result has 191 places, 232 transitions, 2676 flow
[2024-06-04 18:11:20,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2676, PETRI_PLACES=191, PETRI_TRANSITIONS=232}
[2024-06-04 18:11:20,180 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-04 18:11:20,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 232 transitions, 2676 flow
[2024-06-04 18:11:20,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-04 18:11:20,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:20,180 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:20,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:11:20,181 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:20,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:20,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -660324259, now seen corresponding path program 2 times
[2024-06-04 18:11:20,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:20,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330962452]
[2024-06-04 18:11:20,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:20,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:20,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:30,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:30,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:30,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330962452]
[2024-06-04 18:11:30,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330962452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:30,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:30,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:30,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295536166]
[2024-06-04 18:11:30,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:30,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:30,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:30,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:30,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:30,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:11:30,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 232 transitions, 2676 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:30,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:30,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:11:30,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:32,297 INFO  L124   PetriNetUnfolderBase]: 2637/3933 cut-off events.
[2024-06-04 18:11:32,298 INFO  L125   PetriNetUnfolderBase]: For 200332/200334 co-relation queries the response was YES.
[2024-06-04 18:11:32,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29463 conditions, 3933 events. 2637/3933 cut-off events. For 200332/200334 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 18927 event pairs, 716 based on Foata normal form. 6/3939 useless extension candidates. Maximal degree in co-relation 29373. Up to 3819 conditions per place. 
[2024-06-04 18:11:32,336 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 217 selfloop transitions, 33 changer transitions 0/253 dead transitions.
[2024-06-04 18:11:32,336 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 253 transitions, 3276 flow
[2024-06-04 18:11:32,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:11:32,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:11:32,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-04 18:11:32,337 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-04 18:11:32,337 INFO  L175             Difference]: Start difference. First operand has 191 places, 232 transitions, 2676 flow. Second operand 5 states and 92 transitions.
[2024-06-04 18:11:32,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 253 transitions, 3276 flow
[2024-06-04 18:11:32,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 253 transitions, 3073 flow, removed 19 selfloop flow, removed 8 redundant places.
[2024-06-04 18:11:32,530 INFO  L231             Difference]: Finished difference. Result has 188 places, 235 transitions, 2614 flow
[2024-06-04 18:11:32,531 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2473, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2614, PETRI_PLACES=188, PETRI_TRANSITIONS=235}
[2024-06-04 18:11:32,531 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places.
[2024-06-04 18:11:32,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 235 transitions, 2614 flow
[2024-06-04 18:11:32,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:32,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:32,531 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:32,532 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:11:32,532 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:32,532 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:32,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081117085, now seen corresponding path program 3 times
[2024-06-04 18:11:32,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:32,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438610563]
[2024-06-04 18:11:32,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:32,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:32,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:44,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:44,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:44,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438610563]
[2024-06-04 18:11:44,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438610563] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:44,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:44,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:44,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172525333]
[2024-06-04 18:11:44,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:44,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:44,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:44,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:44,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:44,328 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:11:44,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 235 transitions, 2614 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:44,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:44,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:11:44,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:45,706 INFO  L124   PetriNetUnfolderBase]: 2625/3917 cut-off events.
[2024-06-04 18:11:45,706 INFO  L125   PetriNetUnfolderBase]: For 203931/203933 co-relation queries the response was YES.
[2024-06-04 18:11:45,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29052 conditions, 3917 events. 2625/3917 cut-off events. For 203931/203933 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18802 event pairs, 710 based on Foata normal form. 6/3923 useless extension candidates. Maximal degree in co-relation 28961. Up to 3767 conditions per place. 
[2024-06-04 18:11:45,737 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 214 selfloop transitions, 39 changer transitions 0/256 dead transitions.
[2024-06-04 18:11:45,737 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 256 transitions, 3188 flow
[2024-06-04 18:11:45,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:11:45,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:11:45,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-04 18:11:45,738 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 18:11:45,738 INFO  L175             Difference]: Start difference. First operand has 188 places, 235 transitions, 2614 flow. Second operand 6 states and 105 transitions.
[2024-06-04 18:11:45,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 256 transitions, 3188 flow
[2024-06-04 18:11:45,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 256 transitions, 3113 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-04 18:11:45,919 INFO  L231             Difference]: Finished difference. Result has 191 places, 235 transitions, 2631 flow
[2024-06-04 18:11:45,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2631, PETRI_PLACES=191, PETRI_TRANSITIONS=235}
[2024-06-04 18:11:45,920 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-04 18:11:45,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 235 transitions, 2631 flow
[2024-06-04 18:11:45,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:45,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:45,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:45,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:11:45,920 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:45,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:45,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -1811834565, now seen corresponding path program 1 times
[2024-06-04 18:11:45,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:45,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53274649]
[2024-06-04 18:11:45,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:45,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:45,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:55,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:55,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:55,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53274649]
[2024-06-04 18:11:55,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53274649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:55,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:55,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:55,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838418790]
[2024-06-04 18:11:55,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:55,881 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:55,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:55,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:55,882 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:55,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:11:55,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 235 transitions, 2631 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:55,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:55,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:11:55,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:57,401 INFO  L124   PetriNetUnfolderBase]: 2656/3961 cut-off events.
[2024-06-04 18:11:57,401 INFO  L125   PetriNetUnfolderBase]: For 213565/213565 co-relation queries the response was YES.
[2024-06-04 18:11:57,416 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29623 conditions, 3961 events. 2656/3961 cut-off events. For 213565/213565 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 19071 event pairs, 747 based on Foata normal form. 3/3964 useless extension candidates. Maximal degree in co-relation 29531. Up to 3880 conditions per place. 
[2024-06-04 18:11:57,428 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 237 selfloop transitions, 23 changer transitions 0/263 dead transitions.
[2024-06-04 18:11:57,428 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 263 transitions, 3433 flow
[2024-06-04 18:11:57,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:57,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:57,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:11:57,429 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3979591836734694
[2024-06-04 18:11:57,429 INFO  L175             Difference]: Start difference. First operand has 191 places, 235 transitions, 2631 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:11:57,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 263 transitions, 3433 flow
[2024-06-04 18:11:57,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 263 transitions, 3340 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-04 18:11:57,619 INFO  L231             Difference]: Finished difference. Result has 193 places, 241 transitions, 2682 flow
[2024-06-04 18:11:57,619 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2682, PETRI_PLACES=193, PETRI_TRANSITIONS=241}
[2024-06-04 18:11:57,620 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-04 18:11:57,620 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 241 transitions, 2682 flow
[2024-06-04 18:11:57,620 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:57,620 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:57,620 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:57,620 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:11:57,620 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:57,620 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:57,620 INFO  L85        PathProgramCache]: Analyzing trace with hash -837686171, now seen corresponding path program 2 times
[2024-06-04 18:11:57,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:57,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660870111]
[2024-06-04 18:11:57,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:57,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:57,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:07,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:07,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:07,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660870111]
[2024-06-04 18:12:07,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660870111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:07,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:07,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:07,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149677561]
[2024-06-04 18:12:07,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:07,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:07,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:07,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:07,190 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:07,298 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:12:07,298 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 241 transitions, 2682 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:07,298 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:07,298 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:12:07,298 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:08,780 INFO  L124   PetriNetUnfolderBase]: 2686/4003 cut-off events.
[2024-06-04 18:12:08,780 INFO  L125   PetriNetUnfolderBase]: For 215207/215207 co-relation queries the response was YES.
[2024-06-04 18:12:08,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30128 conditions, 4003 events. 2686/4003 cut-off events. For 215207/215207 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 19340 event pairs, 748 based on Foata normal form. 3/4006 useless extension candidates. Maximal degree in co-relation 30036. Up to 3938 conditions per place. 
[2024-06-04 18:12:08,809 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 241 selfloop transitions, 23 changer transitions 0/267 dead transitions.
[2024-06-04 18:12:08,809 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 267 transitions, 3384 flow
[2024-06-04 18:12:08,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:12:08,810 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:12:08,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-04 18:12:08,810 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-04 18:12:08,810 INFO  L175             Difference]: Start difference. First operand has 193 places, 241 transitions, 2682 flow. Second operand 7 states and 112 transitions.
[2024-06-04 18:12:08,810 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 267 transitions, 3384 flow
[2024-06-04 18:12:08,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 267 transitions, 3320 flow, removed 21 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:08,980 INFO  L231             Difference]: Finished difference. Result has 197 places, 249 transitions, 2770 flow
[2024-06-04 18:12:08,980 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2770, PETRI_PLACES=197, PETRI_TRANSITIONS=249}
[2024-06-04 18:12:08,980 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-04 18:12:08,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 249 transitions, 2770 flow
[2024-06-04 18:12:08,981 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:08,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:08,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:08,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:12:08,981 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:08,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:08,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -919599075, now seen corresponding path program 3 times
[2024-06-04 18:12:08,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:08,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371752194]
[2024-06-04 18:12:08,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:08,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:09,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:18,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:18,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:18,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371752194]
[2024-06-04 18:12:18,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371752194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:18,701 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:18,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:18,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978873251]
[2024-06-04 18:12:18,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:18,702 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:18,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:18,702 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:18,702 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:18,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:12:18,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 249 transitions, 2770 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:18,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:18,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:12:18,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:20,284 INFO  L124   PetriNetUnfolderBase]: 2677/3991 cut-off events.
[2024-06-04 18:12:20,285 INFO  L125   PetriNetUnfolderBase]: For 220316/220316 co-relation queries the response was YES.
[2024-06-04 18:12:20,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30098 conditions, 3991 events. 2677/3991 cut-off events. For 220316/220316 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 19237 event pairs, 749 based on Foata normal form. 3/3994 useless extension candidates. Maximal degree in co-relation 30004. Up to 3926 conditions per place. 
[2024-06-04 18:12:20,314 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 244 selfloop transitions, 21 changer transitions 0/268 dead transitions.
[2024-06-04 18:12:20,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 268 transitions, 3387 flow
[2024-06-04 18:12:20,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:12:20,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:12:20,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-04 18:12:20,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-04 18:12:20,315 INFO  L175             Difference]: Start difference. First operand has 197 places, 249 transitions, 2770 flow. Second operand 6 states and 103 transitions.
[2024-06-04 18:12:20,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 268 transitions, 3387 flow
[2024-06-04 18:12:20,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 268 transitions, 3290 flow, removed 29 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:20,521 INFO  L231             Difference]: Finished difference. Result has 199 places, 249 transitions, 2726 flow
[2024-06-04 18:12:20,521 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2726, PETRI_PLACES=199, PETRI_TRANSITIONS=249}
[2024-06-04 18:12:20,521 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-04 18:12:20,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 249 transitions, 2726 flow
[2024-06-04 18:12:20,522 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:20,522 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:20,522 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:20,522 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:12:20,522 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:20,522 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:20,522 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081569499, now seen corresponding path program 1 times
[2024-06-04 18:12:20,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:20,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630844355]
[2024-06-04 18:12:20,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:20,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:20,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:30,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:30,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:30,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630844355]
[2024-06-04 18:12:30,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630844355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:30,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:30,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:30,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719359414]
[2024-06-04 18:12:30,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:30,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:30,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:30,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:30,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:30,183 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:12:30,184 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 249 transitions, 2726 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:30,184 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:30,184 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:12:30,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:31,591 INFO  L124   PetriNetUnfolderBase]: 2671/3983 cut-off events.
[2024-06-04 18:12:31,591 INFO  L125   PetriNetUnfolderBase]: For 225791/225791 co-relation queries the response was YES.
[2024-06-04 18:12:31,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30038 conditions, 3983 events. 2671/3983 cut-off events. For 225791/225791 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19176 event pairs, 737 based on Foata normal form. 2/3985 useless extension candidates. Maximal degree in co-relation 29943. Up to 3917 conditions per place. 
[2024-06-04 18:12:31,622 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 238 selfloop transitions, 24 changer transitions 0/265 dead transitions.
[2024-06-04 18:12:31,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 265 transitions, 3336 flow
[2024-06-04 18:12:31,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:12:31,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:12:31,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions.
[2024-06-04 18:12:31,624 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-04 18:12:31,624 INFO  L175             Difference]: Start difference. First operand has 199 places, 249 transitions, 2726 flow. Second operand 5 states and 88 transitions.
[2024-06-04 18:12:31,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 265 transitions, 3336 flow
[2024-06-04 18:12:31,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 265 transitions, 3283 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-04 18:12:31,898 INFO  L231             Difference]: Finished difference. Result has 199 places, 252 transitions, 2795 flow
[2024-06-04 18:12:31,898 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2795, PETRI_PLACES=199, PETRI_TRANSITIONS=252}
[2024-06-04 18:12:31,899 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-04 18:12:31,899 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 252 transitions, 2795 flow
[2024-06-04 18:12:31,899 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:31,899 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:31,899 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:31,899 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:12:31,900 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:31,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:31,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081578427, now seen corresponding path program 1 times
[2024-06-04 18:12:31,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:31,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772498230]
[2024-06-04 18:12:31,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:31,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:31,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:44,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:44,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:44,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772498230]
[2024-06-04 18:12:44,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772498230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:44,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:44,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:44,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780805050]
[2024-06-04 18:12:44,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:44,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:44,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:44,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:44,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:44,276 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:12:44,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 252 transitions, 2795 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:44,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:44,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:12:44,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:45,579 INFO  L124   PetriNetUnfolderBase]: 2666/3976 cut-off events.
[2024-06-04 18:12:45,580 INFO  L125   PetriNetUnfolderBase]: For 231938/231938 co-relation queries the response was YES.
[2024-06-04 18:12:45,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30397 conditions, 3976 events. 2666/3976 cut-off events. For 231938/231938 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19078 event pairs, 740 based on Foata normal form. 2/3978 useless extension candidates. Maximal degree in co-relation 30301. Up to 3939 conditions per place. 
[2024-06-04 18:12:45,612 INFO  L140   encePairwiseOnDemand]: 36/42 looper letters, 250 selfloop transitions, 11 changer transitions 0/264 dead transitions.
[2024-06-04 18:12:45,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 264 transitions, 3377 flow
[2024-06-04 18:12:45,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:12:45,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:12:45,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2024-06-04 18:12:45,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3904761904761905
[2024-06-04 18:12:45,613 INFO  L175             Difference]: Start difference. First operand has 199 places, 252 transitions, 2795 flow. Second operand 5 states and 82 transitions.
[2024-06-04 18:12:45,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 264 transitions, 3377 flow
[2024-06-04 18:12:45,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 264 transitions, 3319 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:45,884 INFO  L231             Difference]: Finished difference. Result has 201 places, 254 transitions, 2800 flow
[2024-06-04 18:12:45,884 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2800, PETRI_PLACES=201, PETRI_TRANSITIONS=254}
[2024-06-04 18:12:45,884 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 158 predicate places.
[2024-06-04 18:12:45,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 254 transitions, 2800 flow
[2024-06-04 18:12:45,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:45,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:45,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:45,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:12:45,885 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-04 18:12:45,885 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:45,885 INFO  L85        PathProgramCache]: Analyzing trace with hash 558364913, now seen corresponding path program 1 times
[2024-06-04 18:12:45,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:45,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976891474]
[2024-06-04 18:12:45,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:45,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:45,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:56,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:56,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:56,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976891474]
[2024-06-04 18:12:56,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976891474] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:56,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:56,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:12:56,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771182692]
[2024-06-04 18:12:56,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:56,141 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:12:56,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:56,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:12:56,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:12:56,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:12:56,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 254 transitions, 2800 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:56,310 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:56,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:12:56,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:57,864 INFO  L124   PetriNetUnfolderBase]: 2683/4002 cut-off events.
[2024-06-04 18:12:57,864 INFO  L125   PetriNetUnfolderBase]: For 242272/242274 co-relation queries the response was YES.
[2024-06-04 18:12:57,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30832 conditions, 4002 events. 2683/4002 cut-off events. For 242272/242274 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 19249 event pairs, 417 based on Foata normal form. 6/4008 useless extension candidates. Maximal degree in co-relation 30735. Up to 3730 conditions per place. 
[2024-06-04 18:12:57,895 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 268 selfloop transitions, 28 changer transitions 0/299 dead transitions.
[2024-06-04 18:12:57,895 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 299 transitions, 3606 flow
[2024-06-04 18:12:57,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:12:57,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:12:57,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-04 18:12:57,898 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-04 18:12:57,898 INFO  L175             Difference]: Start difference. First operand has 201 places, 254 transitions, 2800 flow. Second operand 9 states and 147 transitions.
[2024-06-04 18:12:57,898 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 299 transitions, 3606 flow
[2024-06-04 18:12:58,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 299 transitions, 3559 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:58,174 INFO  L231             Difference]: Finished difference. Result has 209 places, 262 transitions, 2940 flow
[2024-06-04 18:12:58,174 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2753, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2940, PETRI_PLACES=209, PETRI_TRANSITIONS=262}
[2024-06-04 18:12:58,174 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places.
[2024-06-04 18:12:58,174 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 262 transitions, 2940 flow
[2024-06-04 18:12:58,174 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:58,175 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:58,175 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:58,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:12:58,175 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:58,175 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:58,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 560242583, now seen corresponding path program 2 times
[2024-06-04 18:12:58,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:58,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966833459]
[2024-06-04 18:12:58,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:58,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:58,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:08,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:08,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:08,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966833459]
[2024-06-04 18:13:08,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966833459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:08,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:08,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:13:08,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038665153]
[2024-06-04 18:13:08,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:08,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:13:08,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:08,560 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:13:08,560 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:13:08,743 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:13:08,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 262 transitions, 2940 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:08,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:08,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:13:08,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:10,409 INFO  L124   PetriNetUnfolderBase]: 2700/4029 cut-off events.
[2024-06-04 18:13:10,409 INFO  L125   PetriNetUnfolderBase]: For 254046/254048 co-relation queries the response was YES.
[2024-06-04 18:13:10,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31596 conditions, 4029 events. 2700/4029 cut-off events. For 254046/254048 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19474 event pairs, 550 based on Foata normal form. 6/4035 useless extension candidates. Maximal degree in co-relation 31496. Up to 3810 conditions per place. 
[2024-06-04 18:13:10,438 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 270 selfloop transitions, 28 changer transitions 0/301 dead transitions.
[2024-06-04 18:13:10,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 301 transitions, 3692 flow
[2024-06-04 18:13:10,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:10,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:10,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 18:13:10,440 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3941798941798942
[2024-06-04 18:13:10,440 INFO  L175             Difference]: Start difference. First operand has 209 places, 262 transitions, 2940 flow. Second operand 9 states and 149 transitions.
[2024-06-04 18:13:10,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 301 transitions, 3692 flow
[2024-06-04 18:13:10,658 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 301 transitions, 3615 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:10,661 INFO  L231             Difference]: Finished difference. Result has 215 places, 264 transitions, 2972 flow
[2024-06-04 18:13:10,661 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2863, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2972, PETRI_PLACES=215, PETRI_TRANSITIONS=264}
[2024-06-04 18:13:10,662 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places.
[2024-06-04 18:13:10,662 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 264 transitions, 2972 flow
[2024-06-04 18:13:10,662 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:10,662 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:10,662 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:10,662 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:13:10,662 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:10,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:10,663 INFO  L85        PathProgramCache]: Analyzing trace with hash 560238863, now seen corresponding path program 3 times
[2024-06-04 18:13:10,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:10,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980471633]
[2024-06-04 18:13:10,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:10,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:10,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:21,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:21,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:21,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980471633]
[2024-06-04 18:13:21,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980471633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:21,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:21,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:13:21,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231596049]
[2024-06-04 18:13:21,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:21,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:13:21,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:21,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:13:21,037 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:13:21,352 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:13:21,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 264 transitions, 2972 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:21,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:21,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:13:21,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:23,015 INFO  L124   PetriNetUnfolderBase]: 2717/4056 cut-off events.
[2024-06-04 18:13:23,015 INFO  L125   PetriNetUnfolderBase]: For 266421/266423 co-relation queries the response was YES.
[2024-06-04 18:13:23,035 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32118 conditions, 4056 events. 2717/4056 cut-off events. For 266421/266423 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19614 event pairs, 543 based on Foata normal form. 6/4062 useless extension candidates. Maximal degree in co-relation 32016. Up to 3796 conditions per place. 
[2024-06-04 18:13:23,051 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 271 selfloop transitions, 31 changer transitions 0/305 dead transitions.
[2024-06-04 18:13:23,051 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 305 transitions, 3760 flow
[2024-06-04 18:13:23,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:23,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:23,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-04 18:13:23,052 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-04 18:13:23,052 INFO  L175             Difference]: Start difference. First operand has 215 places, 264 transitions, 2972 flow. Second operand 9 states and 150 transitions.
[2024-06-04 18:13:23,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 305 transitions, 3760 flow
[2024-06-04 18:13:23,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 305 transitions, 3669 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-04 18:13:23,308 INFO  L231             Difference]: Finished difference. Result has 218 places, 268 transitions, 3032 flow
[2024-06-04 18:13:23,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2881, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3032, PETRI_PLACES=218, PETRI_TRANSITIONS=268}
[2024-06-04 18:13:23,308 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places.
[2024-06-04 18:13:23,308 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 268 transitions, 3032 flow
[2024-06-04 18:13:23,309 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:23,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:23,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:23,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:13:23,309 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:23,309 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:23,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 872609243, now seen corresponding path program 1 times
[2024-06-04 18:13:23,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:23,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336355308]
[2024-06-04 18:13:23,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:23,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:23,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:32,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:32,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:32,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336355308]
[2024-06-04 18:13:32,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336355308] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:32,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:32,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:13:32,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310112651]
[2024-06-04 18:13:32,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:32,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:13:32,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:32,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:13:32,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:13:32,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:13:32,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 268 transitions, 3032 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:32,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:32,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:13:32,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:34,374 INFO  L124   PetriNetUnfolderBase]: 2792/4181 cut-off events.
[2024-06-04 18:13:34,374 INFO  L125   PetriNetUnfolderBase]: For 295007/295009 co-relation queries the response was YES.
[2024-06-04 18:13:34,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32996 conditions, 4181 events. 2792/4181 cut-off events. For 295007/295009 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20513 event pairs, 566 based on Foata normal form. 22/4203 useless extension candidates. Maximal degree in co-relation 32892. Up to 3837 conditions per place. 
[2024-06-04 18:13:34,408 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 282 selfloop transitions, 30 changer transitions 0/315 dead transitions.
[2024-06-04 18:13:34,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 315 transitions, 3834 flow
[2024-06-04 18:13:34,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:13:34,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:13:34,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-04 18:13:34,410 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3976190476190476
[2024-06-04 18:13:34,410 INFO  L175             Difference]: Start difference. First operand has 218 places, 268 transitions, 3032 flow. Second operand 10 states and 167 transitions.
[2024-06-04 18:13:34,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 315 transitions, 3834 flow
[2024-06-04 18:13:34,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 315 transitions, 3744 flow, removed 29 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:34,688 INFO  L231             Difference]: Finished difference. Result has 223 places, 269 transitions, 3033 flow
[2024-06-04 18:13:34,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2942, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3033, PETRI_PLACES=223, PETRI_TRANSITIONS=269}
[2024-06-04 18:13:34,689 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places.
[2024-06-04 18:13:34,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 269 transitions, 3033 flow
[2024-06-04 18:13:34,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:34,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:34,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:34,689 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:13:34,689 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:34,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:34,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 138805821, now seen corresponding path program 2 times
[2024-06-04 18:13:34,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:34,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210161363]
[2024-06-04 18:13:34,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:34,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:34,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:44,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:44,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:44,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210161363]
[2024-06-04 18:13:44,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210161363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:44,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:44,003 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:44,003 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619436516]
[2024-06-04 18:13:44,003 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:44,003 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:44,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:44,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:44,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:44,242 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:13:44,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 269 transitions, 3033 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:44,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:44,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:13:44,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:46,062 INFO  L124   PetriNetUnfolderBase]: 2961/4467 cut-off events.
[2024-06-04 18:13:46,062 INFO  L125   PetriNetUnfolderBase]: For 325215/325227 co-relation queries the response was YES.
[2024-06-04 18:13:46,081 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35502 conditions, 4467 events. 2961/4467 cut-off events. For 325215/325227 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 22451 event pairs, 478 based on Foata normal form. 22/4489 useless extension candidates. Maximal degree in co-relation 35396. Up to 3167 conditions per place. 
[2024-06-04 18:13:46,096 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 212 selfloop transitions, 102 changer transitions 0/317 dead transitions.
[2024-06-04 18:13:46,096 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 317 transitions, 4059 flow
[2024-06-04 18:13:46,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:46,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:46,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-04 18:13:46,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-04 18:13:46,098 INFO  L175             Difference]: Start difference. First operand has 223 places, 269 transitions, 3033 flow. Second operand 9 states and 165 transitions.
[2024-06-04 18:13:46,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 317 transitions, 4059 flow
[2024-06-04 18:13:46,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 317 transitions, 3990 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-04 18:13:46,460 INFO  L231             Difference]: Finished difference. Result has 224 places, 271 transitions, 3224 flow
[2024-06-04 18:13:46,461 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2964, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3224, PETRI_PLACES=224, PETRI_TRANSITIONS=271}
[2024-06-04 18:13:46,461 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places.
[2024-06-04 18:13:46,461 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 271 transitions, 3224 flow
[2024-06-04 18:13:46,461 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:46,461 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:46,461 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:46,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:13:46,461 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:46,462 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:46,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -1741126529, now seen corresponding path program 3 times
[2024-06-04 18:13:46,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:46,462 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161368273]
[2024-06-04 18:13:46,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:46,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:46,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:55,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:55,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:55,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161368273]
[2024-06-04 18:13:55,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161368273] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:55,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:55,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:55,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259673722]
[2024-06-04 18:13:55,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:55,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:55,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:55,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:55,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:55,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:13:55,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 271 transitions, 3224 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:55,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:55,836 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:13:55,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:57,680 INFO  L124   PetriNetUnfolderBase]: 3036/4592 cut-off events.
[2024-06-04 18:13:57,681 INFO  L125   PetriNetUnfolderBase]: For 344412/344424 co-relation queries the response was YES.
[2024-06-04 18:13:57,703 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36774 conditions, 4592 events. 3036/4592 cut-off events. For 344412/344424 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23438 event pairs, 593 based on Foata normal form. 26/4618 useless extension candidates. Maximal degree in co-relation 36667. Up to 3704 conditions per place. 
[2024-06-04 18:13:57,718 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 210 selfloop transitions, 99 changer transitions 0/312 dead transitions.
[2024-06-04 18:13:57,718 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 312 transitions, 4002 flow
[2024-06-04 18:13:57,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:57,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:57,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-04 18:13:57,719 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-04 18:13:57,719 INFO  L175             Difference]: Start difference. First operand has 224 places, 271 transitions, 3224 flow. Second operand 9 states and 159 transitions.
[2024-06-04 18:13:57,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 312 transitions, 4002 flow
[2024-06-04 18:13:58,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 312 transitions, 3854 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:58,043 INFO  L231             Difference]: Finished difference. Result has 228 places, 272 transitions, 3311 flow
[2024-06-04 18:13:58,043 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3080, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3311, PETRI_PLACES=228, PETRI_TRANSITIONS=272}
[2024-06-04 18:13:58,043 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-04 18:13:58,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 272 transitions, 3311 flow
[2024-06-04 18:13:58,043 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:58,043 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:58,044 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:58,044 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:13:58,044 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:58,044 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:58,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -1006834861, now seen corresponding path program 4 times
[2024-06-04 18:13:58,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:58,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703819118]
[2024-06-04 18:13:58,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:58,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:58,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:09,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:09,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:09,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703819118]
[2024-06-04 18:14:09,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703819118] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:09,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:09,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:14:09,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110771858]
[2024-06-04 18:14:09,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:09,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:14:09,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:09,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:14:09,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:14:09,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:14:09,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 272 transitions, 3311 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:09,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:09,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:14:09,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:11,582 INFO  L124   PetriNetUnfolderBase]: 3053/4613 cut-off events.
[2024-06-04 18:14:11,583 INFO  L125   PetriNetUnfolderBase]: For 337049/337049 co-relation queries the response was YES.
[2024-06-04 18:14:11,607 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37428 conditions, 4613 events. 3053/4613 cut-off events. For 337049/337049 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 23591 event pairs, 617 based on Foata normal form. 4/4617 useless extension candidates. Maximal degree in co-relation 37319. Up to 4255 conditions per place. 
[2024-06-04 18:14:11,624 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 262 selfloop transitions, 45 changer transitions 0/310 dead transitions.
[2024-06-04 18:14:11,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 310 transitions, 4085 flow
[2024-06-04 18:14:11,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:11,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:11,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-04 18:14:11,626 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4021164021164021
[2024-06-04 18:14:11,626 INFO  L175             Difference]: Start difference. First operand has 228 places, 272 transitions, 3311 flow. Second operand 9 states and 152 transitions.
[2024-06-04 18:14:11,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 310 transitions, 4085 flow
[2024-06-04 18:14:12,099 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 310 transitions, 3882 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-04 18:14:12,102 INFO  L231             Difference]: Finished difference. Result has 230 places, 274 transitions, 3263 flow
[2024-06-04 18:14:12,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3108, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3263, PETRI_PLACES=230, PETRI_TRANSITIONS=274}
[2024-06-04 18:14:12,103 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places.
[2024-06-04 18:14:12,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 274 transitions, 3263 flow
[2024-06-04 18:14:12,103 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:12,103 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:12,103 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:12,103 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:14:12,103 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:12,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:12,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 151518115, now seen corresponding path program 5 times
[2024-06-04 18:14:12,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:12,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122409115]
[2024-06-04 18:14:12,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:12,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:12,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:22,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:22,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:22,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122409115]
[2024-06-04 18:14:22,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122409115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:22,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:22,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:14:22,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117189939]
[2024-06-04 18:14:22,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:22,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:14:22,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:22,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:14:22,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:14:23,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:14:23,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 274 transitions, 3263 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:23,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:23,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:14:23,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:24,892 INFO  L124   PetriNetUnfolderBase]: 3070/4640 cut-off events.
[2024-06-04 18:14:24,893 INFO  L125   PetriNetUnfolderBase]: For 350360/350360 co-relation queries the response was YES.
[2024-06-04 18:14:24,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37680 conditions, 4640 events. 3070/4640 cut-off events. For 350360/350360 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23786 event pairs, 627 based on Foata normal form. 4/4644 useless extension candidates. Maximal degree in co-relation 37570. Up to 4282 conditions per place. 
[2024-06-04 18:14:24,933 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 264 selfloop transitions, 44 changer transitions 0/311 dead transitions.
[2024-06-04 18:14:24,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 311 transitions, 4039 flow
[2024-06-04 18:14:24,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:24,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:24,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-04 18:14:24,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4021164021164021
[2024-06-04 18:14:24,935 INFO  L175             Difference]: Start difference. First operand has 230 places, 274 transitions, 3263 flow. Second operand 9 states and 152 transitions.
[2024-06-04 18:14:24,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 311 transitions, 4039 flow
[2024-06-04 18:14:25,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 311 transitions, 3902 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-04 18:14:25,340 INFO  L231             Difference]: Finished difference. Result has 232 places, 276 transitions, 3283 flow
[2024-06-04 18:14:25,341 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3126, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3283, PETRI_PLACES=232, PETRI_TRANSITIONS=276}
[2024-06-04 18:14:25,341 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places.
[2024-06-04 18:14:25,341 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 276 transitions, 3283 flow
[2024-06-04 18:14:25,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:25,341 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:25,341 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:25,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:14:25,341 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:25,341 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:25,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 151668217, now seen corresponding path program 4 times
[2024-06-04 18:14:25,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:25,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823819431]
[2024-06-04 18:14:25,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:25,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:25,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:34,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:34,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:34,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823819431]
[2024-06-04 18:14:34,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823819431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:34,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:34,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:14:34,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793407627]
[2024-06-04 18:14:34,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:34,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:14:34,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:34,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:14:34,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:14:35,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:14:35,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 276 transitions, 3283 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:35,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:35,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:14:35,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:37,514 INFO  L124   PetriNetUnfolderBase]: 3145/4765 cut-off events.
[2024-06-04 18:14:37,515 INFO  L125   PetriNetUnfolderBase]: For 384329/384329 co-relation queries the response was YES.
[2024-06-04 18:14:37,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38496 conditions, 4765 events. 3145/4765 cut-off events. For 384329/384329 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24678 event pairs, 637 based on Foata normal form. 20/4785 useless extension candidates. Maximal degree in co-relation 38385. Up to 4282 conditions per place. 
[2024-06-04 18:14:37,551 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 46 changer transitions 0/321 dead transitions.
[2024-06-04 18:14:37,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 321 transitions, 4087 flow
[2024-06-04 18:14:37,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:37,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:37,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions.
[2024-06-04 18:14:37,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 18:14:37,554 INFO  L175             Difference]: Start difference. First operand has 232 places, 276 transitions, 3283 flow. Second operand 10 states and 170 transitions.
[2024-06-04 18:14:37,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 321 transitions, 4087 flow
[2024-06-04 18:14:37,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 321 transitions, 3948 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-04 18:14:37,924 INFO  L231             Difference]: Finished difference. Result has 235 places, 277 transitions, 3269 flow
[2024-06-04 18:14:37,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3269, PETRI_PLACES=235, PETRI_TRANSITIONS=277}
[2024-06-04 18:14:37,925 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places.
[2024-06-04 18:14:37,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 277 transitions, 3269 flow
[2024-06-04 18:14:37,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:37,925 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:37,925 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:37,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:14:37,926 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:37,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:37,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 157030597, now seen corresponding path program 5 times
[2024-06-04 18:14:37,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:37,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528442500]
[2024-06-04 18:14:37,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:37,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:37,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:47,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:47,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:47,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528442500]
[2024-06-04 18:14:47,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528442500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:47,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:47,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:14:47,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987526405]
[2024-06-04 18:14:47,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:47,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:14:47,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:47,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:14:47,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:14:47,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:14:47,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 277 transitions, 3269 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:47,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:47,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:14:47,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:49,839 INFO  L124   PetriNetUnfolderBase]: 3220/4890 cut-off events.
[2024-06-04 18:14:49,840 INFO  L125   PetriNetUnfolderBase]: For 398128/398128 co-relation queries the response was YES.
[2024-06-04 18:14:49,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39234 conditions, 4890 events. 3220/4890 cut-off events. For 398128/398128 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 25603 event pairs, 656 based on Foata normal form. 20/4910 useless extension candidates. Maximal degree in co-relation 39122. Up to 4389 conditions per place. 
[2024-06-04 18:14:49,878 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 271 selfloop transitions, 49 changer transitions 0/323 dead transitions.
[2024-06-04 18:14:49,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 323 transitions, 4083 flow
[2024-06-04 18:14:49,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:49,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:49,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions.
[2024-06-04 18:14:49,881 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40714285714285714
[2024-06-04 18:14:49,881 INFO  L175             Difference]: Start difference. First operand has 235 places, 277 transitions, 3269 flow. Second operand 10 states and 171 transitions.
[2024-06-04 18:14:49,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 323 transitions, 4083 flow
[2024-06-04 18:14:50,328 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 323 transitions, 3982 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-04 18:14:50,332 INFO  L231             Difference]: Finished difference. Result has 237 places, 278 transitions, 3304 flow
[2024-06-04 18:14:50,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3304, PETRI_PLACES=237, PETRI_TRANSITIONS=278}
[2024-06-04 18:14:50,332 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places.
[2024-06-04 18:14:50,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 278 transitions, 3304 flow
[2024-06-04 18:14:50,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:50,333 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:50,333 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:50,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:14:50,333 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:50,333 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:50,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 151514395, now seen corresponding path program 6 times
[2024-06-04 18:14:50,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:50,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368606266]
[2024-06-04 18:14:50,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:50,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:50,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:01,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:01,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:01,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368606266]
[2024-06-04 18:15:01,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368606266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:01,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:01,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:15:01,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120724765]
[2024-06-04 18:15:01,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:01,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:15:01,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:01,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:15:01,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:15:01,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:15:01,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 278 transitions, 3304 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:01,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:01,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:15:01,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:03,470 INFO  L124   PetriNetUnfolderBase]: 3237/4917 cut-off events.
[2024-06-04 18:15:03,470 INFO  L125   PetriNetUnfolderBase]: For 390480/390480 co-relation queries the response was YES.
[2024-06-04 18:15:03,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39718 conditions, 4917 events. 3237/4917 cut-off events. For 390480/390480 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25729 event pairs, 659 based on Foata normal form. 4/4921 useless extension candidates. Maximal degree in co-relation 39605. Up to 4214 conditions per place. 
[2024-06-04 18:15:03,511 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 266 selfloop transitions, 57 changer transitions 0/326 dead transitions.
[2024-06-04 18:15:03,511 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 326 transitions, 4190 flow
[2024-06-04 18:15:03,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:03,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:03,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions.
[2024-06-04 18:15:03,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40714285714285714
[2024-06-04 18:15:03,513 INFO  L175             Difference]: Start difference. First operand has 237 places, 278 transitions, 3304 flow. Second operand 10 states and 171 transitions.
[2024-06-04 18:15:03,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 326 transitions, 4190 flow
[2024-06-04 18:15:03,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 326 transitions, 4084 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-04 18:15:03,965 INFO  L231             Difference]: Finished difference. Result has 240 places, 282 transitions, 3436 flow
[2024-06-04 18:15:03,966 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3436, PETRI_PLACES=240, PETRI_TRANSITIONS=282}
[2024-06-04 18:15:03,966 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-04 18:15:03,966 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 282 transitions, 3436 flow
[2024-06-04 18:15:03,966 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:03,966 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:03,966 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:03,966 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:15:03,966 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:03,967 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:03,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 67891447, now seen corresponding path program 6 times
[2024-06-04 18:15:03,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:03,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286627667]
[2024-06-04 18:15:03,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:03,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:04,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:13,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:13,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:13,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286627667]
[2024-06-04 18:15:13,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286627667] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:13,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:13,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:15:13,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534544305]
[2024-06-04 18:15:13,574 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:13,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:15:13,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:13,575 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:15:13,575 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:15:13,855 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:15:13,856 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 282 transitions, 3436 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:13,856 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:13,856 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:15:13,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:16,176 INFO  L124   PetriNetUnfolderBase]: 3406/5202 cut-off events.
[2024-06-04 18:15:16,176 INFO  L125   PetriNetUnfolderBase]: For 455273/455285 co-relation queries the response was YES.
[2024-06-04 18:15:16,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42739 conditions, 5202 events. 3406/5202 cut-off events. For 455273/455285 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 27820 event pairs, 636 based on Foata normal form. 22/5224 useless extension candidates. Maximal degree in co-relation 42624. Up to 4109 conditions per place. 
[2024-06-04 18:15:16,224 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 104 changer transitions 0/336 dead transitions.
[2024-06-04 18:15:16,224 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 336 transitions, 4562 flow
[2024-06-04 18:15:16,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:16,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:16,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-04 18:15:16,226 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-04 18:15:16,226 INFO  L175             Difference]: Start difference. First operand has 240 places, 282 transitions, 3436 flow. Second operand 10 states and 181 transitions.
[2024-06-04 18:15:16,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 336 transitions, 4562 flow
[2024-06-04 18:15:16,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 336 transitions, 4428 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:16,697 INFO  L231             Difference]: Finished difference. Result has 244 places, 284 transitions, 3582 flow
[2024-06-04 18:15:16,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3302, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3582, PETRI_PLACES=244, PETRI_TRANSITIONS=284}
[2024-06-04 18:15:16,698 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-04 18:15:16,698 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 284 transitions, 3582 flow
[2024-06-04 18:15:16,698 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:16,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:16,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:16,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:15:16,698 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:16,699 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:16,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 67884007, now seen corresponding path program 7 times
[2024-06-04 18:15:16,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:16,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818787368]
[2024-06-04 18:15:16,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:16,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:16,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:26,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:26,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:26,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818787368]
[2024-06-04 18:15:26,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818787368] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:26,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:26,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:15:26,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004656834]
[2024-06-04 18:15:26,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:26,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:15:26,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:26,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:15:26,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:15:26,694 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:15:26,694 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 284 transitions, 3582 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:26,694 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:26,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:15:26,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:28,859 INFO  L124   PetriNetUnfolderBase]: 3370/5146 cut-off events.
[2024-06-04 18:15:28,859 INFO  L125   PetriNetUnfolderBase]: For 445697/445709 co-relation queries the response was YES.
[2024-06-04 18:15:28,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41964 conditions, 5146 events. 3370/5146 cut-off events. For 445697/445709 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27492 event pairs, 638 based on Foata normal form. 26/5172 useless extension candidates. Maximal degree in co-relation 41847. Up to 4237 conditions per place. 
[2024-06-04 18:15:28,903 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 102 changer transitions 0/329 dead transitions.
[2024-06-04 18:15:28,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 329 transitions, 4384 flow
[2024-06-04 18:15:28,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:28,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:28,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-04 18:15:28,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-04 18:15:28,906 INFO  L175             Difference]: Start difference. First operand has 244 places, 284 transitions, 3582 flow. Second operand 10 states and 174 transitions.
[2024-06-04 18:15:28,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 329 transitions, 4384 flow
[2024-06-04 18:15:29,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 329 transitions, 4200 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:29,368 INFO  L231             Difference]: Finished difference. Result has 248 places, 284 transitions, 3609 flow
[2024-06-04 18:15:29,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3609, PETRI_PLACES=248, PETRI_TRANSITIONS=284}
[2024-06-04 18:15:29,369 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places.
[2024-06-04 18:15:29,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 284 transitions, 3609 flow
[2024-06-04 18:15:29,369 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:29,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:29,369 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:29,370 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:15:29,370 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:29,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:29,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -571980307, now seen corresponding path program 7 times
[2024-06-04 18:15:29,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:29,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907662289]
[2024-06-04 18:15:29,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:29,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:29,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:38,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:38,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:38,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907662289]
[2024-06-04 18:15:38,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907662289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:38,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:38,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:15:38,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240163546]
[2024-06-04 18:15:38,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:38,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:15:38,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:38,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:15:38,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:15:38,932 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:15:38,932 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 284 transitions, 3609 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:38,932 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:38,932 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:15:38,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:41,070 INFO  L124   PetriNetUnfolderBase]: 3387/5173 cut-off events.
[2024-06-04 18:15:41,071 INFO  L125   PetriNetUnfolderBase]: For 433542/433554 co-relation queries the response was YES.
[2024-06-04 18:15:41,094 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42432 conditions, 5173 events. 3387/5173 cut-off events. For 433542/433554 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27698 event pairs, 663 based on Foata normal form. 10/5183 useless extension candidates. Maximal degree in co-relation 42314. Up to 4366 conditions per place. 
[2024-06-04 18:15:41,112 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 225 selfloop transitions, 94 changer transitions 0/322 dead transitions.
[2024-06-04 18:15:41,112 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 322 transitions, 4421 flow
[2024-06-04 18:15:41,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:41,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:41,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-04 18:15:41,114 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41798941798941797
[2024-06-04 18:15:41,114 INFO  L175             Difference]: Start difference. First operand has 248 places, 284 transitions, 3609 flow. Second operand 9 states and 158 transitions.
[2024-06-04 18:15:41,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 322 transitions, 4421 flow
[2024-06-04 18:15:41,593 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 322 transitions, 4179 flow, removed 1 selfloop flow, removed 11 redundant places.
[2024-06-04 18:15:41,597 INFO  L231             Difference]: Finished difference. Result has 246 places, 286 transitions, 3634 flow
[2024-06-04 18:15:41,597 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3367, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3634, PETRI_PLACES=246, PETRI_TRANSITIONS=286}
[2024-06-04 18:15:41,597 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-04 18:15:41,598 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 286 transitions, 3634 flow
[2024-06-04 18:15:41,598 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:41,598 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:41,598 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:41,598 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:15:41,598 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:41,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:41,598 INFO  L85        PathProgramCache]: Analyzing trace with hash -2065422669, now seen corresponding path program 8 times
[2024-06-04 18:15:41,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:41,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268506068]
[2024-06-04 18:15:41,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:41,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:41,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:52,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:52,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:52,474 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268506068]
[2024-06-04 18:15:52,474 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268506068] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:52,474 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:52,474 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:15:52,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767287014]
[2024-06-04 18:15:52,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:52,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:15:52,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:52,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:15:52,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:15:52,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 18:15:52,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 286 transitions, 3634 flow. Second operand  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:52,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:52,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 18:15:52,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:55,047 INFO  L124   PetriNetUnfolderBase]: 3462/5298 cut-off events.
[2024-06-04 18:15:55,047 INFO  L125   PetriNetUnfolderBase]: For 475148/475160 co-relation queries the response was YES.
[2024-06-04 18:15:55,078 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43301 conditions, 5298 events. 3462/5298 cut-off events. For 475148/475160 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28566 event pairs, 688 based on Foata normal form. 26/5324 useless extension candidates. Maximal degree in co-relation 43182. Up to 4655 conditions per place. 
[2024-06-04 18:15:55,189 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 265 selfloop transitions, 64 changer transitions 0/332 dead transitions.
[2024-06-04 18:15:55,189 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 332 transitions, 4468 flow
[2024-06-04 18:15:55,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:55,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:55,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-04 18:15:55,192 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-04 18:15:55,192 INFO  L175             Difference]: Start difference. First operand has 246 places, 286 transitions, 3634 flow. Second operand 10 states and 184 transitions.
[2024-06-04 18:15:55,192 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 332 transitions, 4468 flow
[2024-06-04 18:15:55,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 332 transitions, 4219 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-04 18:15:55,638 INFO  L231             Difference]: Finished difference. Result has 249 places, 287 transitions, 3550 flow
[2024-06-04 18:15:55,639 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3385, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3550, PETRI_PLACES=249, PETRI_TRANSITIONS=287}
[2024-06-04 18:15:55,639 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places.
[2024-06-04 18:15:55,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 287 transitions, 3550 flow
[2024-06-04 18:15:55,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:55,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:55,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:55,640 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:15:55,640 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:55,640 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:55,640 INFO  L85        PathProgramCache]: Analyzing trace with hash -1383838843, now seen corresponding path program 8 times
[2024-06-04 18:15:55,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:55,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017169065]
[2024-06-04 18:15:55,641 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:55,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:55,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:06,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:06,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:06,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017169065]
[2024-06-04 18:16:06,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017169065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:06,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:06,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:06,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173831233]
[2024-06-04 18:16:06,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:06,654 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:06,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:06,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:06,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:06,820 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:16:06,821 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 287 transitions, 3550 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:06,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:06,821 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:16:06,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:08,976 INFO  L124   PetriNetUnfolderBase]: 3479/5325 cut-off events.
[2024-06-04 18:16:08,976 INFO  L125   PetriNetUnfolderBase]: For 463934/463946 co-relation queries the response was YES.
[2024-06-04 18:16:09,001 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43503 conditions, 5325 events. 3479/5325 cut-off events. For 463934/463946 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 28794 event pairs, 683 based on Foata normal form. 10/5335 useless extension candidates. Maximal degree in co-relation 43383. Up to 4518 conditions per place. 
[2024-06-04 18:16:09,019 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 96 changer transitions 0/323 dead transitions.
[2024-06-04 18:16:09,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 323 transitions, 4362 flow
[2024-06-04 18:16:09,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:09,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:09,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-04 18:16:09,021 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4126984126984127
[2024-06-04 18:16:09,022 INFO  L175             Difference]: Start difference. First operand has 249 places, 287 transitions, 3550 flow. Second operand 9 states and 156 transitions.
[2024-06-04 18:16:09,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 323 transitions, 4362 flow
[2024-06-04 18:16:09,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 323 transitions, 4221 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-04 18:16:09,471 INFO  L231             Difference]: Finished difference. Result has 250 places, 289 transitions, 3684 flow
[2024-06-04 18:16:09,471 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3409, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3684, PETRI_PLACES=250, PETRI_TRANSITIONS=289}
[2024-06-04 18:16:09,471 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places.
[2024-06-04 18:16:09,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 289 transitions, 3684 flow
[2024-06-04 18:16:09,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:09,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:09,472 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:09,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:16:09,472 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:09,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:09,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -1383688741, now seen corresponding path program 9 times
[2024-06-04 18:16:09,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:09,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447045545]
[2024-06-04 18:16:09,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:09,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:09,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:21,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-04 18:16:21,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:21,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447045545]
[2024-06-04 18:16:21,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447045545] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:21,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:21,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:21,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966193355]
[2024-06-04 18:16:21,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:21,207 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:21,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:21,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:21,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:21,402 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:16:21,402 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 289 transitions, 3684 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:21,402 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:21,402 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:16:21,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:23,807 INFO  L124   PetriNetUnfolderBase]: 3554/5450 cut-off events.
[2024-06-04 18:16:23,808 INFO  L125   PetriNetUnfolderBase]: For 507560/507572 co-relation queries the response was YES.
[2024-06-04 18:16:23,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44580 conditions, 5450 events. 3554/5450 cut-off events. For 507560/507572 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 29678 event pairs, 708 based on Foata normal form. 26/5476 useless extension candidates. Maximal degree in co-relation 44459. Up to 4761 conditions per place. 
[2024-06-04 18:16:23,852 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 264 selfloop transitions, 71 changer transitions 0/338 dead transitions.
[2024-06-04 18:16:23,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 338 transitions, 4540 flow
[2024-06-04 18:16:23,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:16:23,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:16:23,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions.
[2024-06-04 18:16:23,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4025974025974026
[2024-06-04 18:16:23,855 INFO  L175             Difference]: Start difference. First operand has 250 places, 289 transitions, 3684 flow. Second operand 11 states and 186 transitions.
[2024-06-04 18:16:23,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 338 transitions, 4540 flow
[2024-06-04 18:16:24,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 338 transitions, 4283 flow, removed 34 selfloop flow, removed 7 redundant places.
[2024-06-04 18:16:24,237 INFO  L231             Difference]: Finished difference. Result has 254 places, 290 transitions, 3608 flow
[2024-06-04 18:16:24,237 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3427, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3608, PETRI_PLACES=254, PETRI_TRANSITIONS=290}
[2024-06-04 18:16:24,237 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places.
[2024-06-04 18:16:24,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 290 transitions, 3608 flow
[2024-06-04 18:16:24,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:24,237 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:24,237 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:24,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 18:16:24,238 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:24,238 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:24,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -1383842563, now seen corresponding path program 9 times
[2024-06-04 18:16:24,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:24,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418002530]
[2024-06-04 18:16:24,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:24,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:24,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:33,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:33,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:33,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418002530]
[2024-06-04 18:16:33,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418002530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:33,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:33,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 18:16:33,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764895619]
[2024-06-04 18:16:33,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:33,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 18:16:33,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:33,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 18:16:33,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-04 18:16:34,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:16:34,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 290 transitions, 3608 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:34,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:34,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:16:34,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:36,420 INFO  L124   PetriNetUnfolderBase]: 3571/5477 cut-off events.
[2024-06-04 18:16:36,420 INFO  L125   PetriNetUnfolderBase]: For 495097/495109 co-relation queries the response was YES.
[2024-06-04 18:16:36,447 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44815 conditions, 5477 events. 3571/5477 cut-off events. For 495097/495109 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29918 event pairs, 691 based on Foata normal form. 10/5487 useless extension candidates. Maximal degree in co-relation 44693. Up to 4467 conditions per place. 
[2024-06-04 18:16:36,465 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 103 changer transitions 0/335 dead transitions.
[2024-06-04 18:16:36,465 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 335 transitions, 4800 flow
[2024-06-04 18:16:36,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:36,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:36,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-04 18:16:36,467 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 18:16:36,468 INFO  L175             Difference]: Start difference. First operand has 254 places, 290 transitions, 3608 flow. Second operand 9 states and 162 transitions.
[2024-06-04 18:16:36,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 335 transitions, 4800 flow
[2024-06-04 18:16:36,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 335 transitions, 4643 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-06-04 18:16:36,970 INFO  L231             Difference]: Finished difference. Result has 255 places, 295 transitions, 3840 flow
[2024-06-04 18:16:36,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3451, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3840, PETRI_PLACES=255, PETRI_TRANSITIONS=295}
[2024-06-04 18:16:36,971 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 212 predicate places.
[2024-06-04 18:16:36,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 295 transitions, 3840 flow
[2024-06-04 18:16:36,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:36,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:36,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:36,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 18:16:36,971 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:36,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:36,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 499461335, now seen corresponding path program 10 times
[2024-06-04 18:16:36,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:36,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346399782]
[2024-06-04 18:16:36,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:36,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:37,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:47,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:47,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:47,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346399782]
[2024-06-04 18:16:47,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346399782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:47,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:47,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:47,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630651638]
[2024-06-04 18:16:47,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:47,430 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:47,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:47,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:47,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:47,662 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:16:47,662 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 295 transitions, 3840 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:47,662 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:47,662 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:16:47,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:50,007 INFO  L124   PetriNetUnfolderBase]: 3563/5465 cut-off events.
[2024-06-04 18:16:50,007 INFO  L125   PetriNetUnfolderBase]: For 502590/502602 co-relation queries the response was YES.
[2024-06-04 18:16:50,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44921 conditions, 5465 events. 3563/5465 cut-off events. For 502590/502602 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 29802 event pairs, 671 based on Foata normal form. 10/5475 useless extension candidates. Maximal degree in co-relation 44797. Up to 4538 conditions per place. 
[2024-06-04 18:16:50,053 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 235 selfloop transitions, 97 changer transitions 0/335 dead transitions.
[2024-06-04 18:16:50,053 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 335 transitions, 4677 flow
[2024-06-04 18:16:50,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:50,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:50,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-04 18:16:50,056 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-04 18:16:50,056 INFO  L175             Difference]: Start difference. First operand has 255 places, 295 transitions, 3840 flow. Second operand 9 states and 160 transitions.
[2024-06-04 18:16:50,056 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 335 transitions, 4677 flow
[2024-06-04 18:16:50,709 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 335 transitions, 4419 flow, removed 72 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:50,713 INFO  L231             Difference]: Finished difference. Result has 259 places, 296 transitions, 3829 flow
[2024-06-04 18:16:50,713 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3604, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3829, PETRI_PLACES=259, PETRI_TRANSITIONS=296}
[2024-06-04 18:16:50,713 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places.
[2024-06-04 18:16:50,713 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 296 transitions, 3829 flow
[2024-06-04 18:16:50,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:50,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:50,714 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:50,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 18:16:50,714 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:50,714 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:50,714 INFO  L85        PathProgramCache]: Analyzing trace with hash 499467287, now seen corresponding path program 10 times
[2024-06-04 18:16:50,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:50,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146995084]
[2024-06-04 18:16:50,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:50,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:50,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:00,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:00,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:00,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146995084]
[2024-06-04 18:17:00,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146995084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:00,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:00,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:17:00,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328333883]
[2024-06-04 18:17:00,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:00,620 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:17:00,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:00,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:17:00,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:17:00,786 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:17:00,786 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 296 transitions, 3829 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:00,786 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:00,786 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:17:00,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:03,169 INFO  L124   PetriNetUnfolderBase]: 3527/5409 cut-off events.
[2024-06-04 18:17:03,169 INFO  L125   PetriNetUnfolderBase]: For 504666/504678 co-relation queries the response was YES.
[2024-06-04 18:17:03,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43591 conditions, 5409 events. 3527/5409 cut-off events. For 504666/504678 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 29436 event pairs, 673 based on Foata normal form. 26/5435 useless extension candidates. Maximal degree in co-relation 43465. Up to 4766 conditions per place. 
[2024-06-04 18:17:03,215 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 269 selfloop transitions, 68 changer transitions 0/340 dead transitions.
[2024-06-04 18:17:03,216 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 340 transitions, 4649 flow
[2024-06-04 18:17:03,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:17:03,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:17:03,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions.
[2024-06-04 18:17:03,218 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40714285714285714
[2024-06-04 18:17:03,218 INFO  L175             Difference]: Start difference. First operand has 259 places, 296 transitions, 3829 flow. Second operand 10 states and 171 transitions.
[2024-06-04 18:17:03,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 340 transitions, 4649 flow
[2024-06-04 18:17:03,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 340 transitions, 4444 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-04 18:17:03,724 INFO  L231             Difference]: Finished difference. Result has 261 places, 296 transitions, 3767 flow
[2024-06-04 18:17:03,724 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3624, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3767, PETRI_PLACES=261, PETRI_TRANSITIONS=296}
[2024-06-04 18:17:03,725 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places.
[2024-06-04 18:17:03,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 296 transitions, 3767 flow
[2024-06-04 18:17:03,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:03,725 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:03,725 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:03,725 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 18:17:03,726 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:03,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:03,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 1068946455, now seen corresponding path program 11 times
[2024-06-04 18:17:03,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:03,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719425804]
[2024-06-04 18:17:03,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:03,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:03,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:14,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:14,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:14,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719425804]
[2024-06-04 18:17:14,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719425804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:14,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:14,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:14,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112723204]
[2024-06-04 18:17:14,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:14,375 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:14,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:14,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:14,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:14,621 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:17:14,621 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 296 transitions, 3767 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:14,621 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:14,621 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:17:14,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:16,898 INFO  L124   PetriNetUnfolderBase]: 3596/5532 cut-off events.
[2024-06-04 18:17:16,899 INFO  L125   PetriNetUnfolderBase]: For 507804/507816 co-relation queries the response was YES.
[2024-06-04 18:17:16,927 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44367 conditions, 5532 events. 3596/5532 cut-off events. For 507804/507816 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30156 event pairs, 582 based on Foata normal form. 22/5554 useless extension candidates. Maximal degree in co-relation 44241. Up to 3068 conditions per place. 
[2024-06-04 18:17:16,947 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 229 selfloop transitions, 112 changer transitions 0/344 dead transitions.
[2024-06-04 18:17:16,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 344 transitions, 4939 flow
[2024-06-04 18:17:16,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:16,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:16,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-04 18:17:16,949 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-04 18:17:16,949 INFO  L175             Difference]: Start difference. First operand has 261 places, 296 transitions, 3767 flow. Second operand 9 states and 164 transitions.
[2024-06-04 18:17:16,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 344 transitions, 4939 flow
[2024-06-04 18:17:17,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 344 transitions, 4788 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-04 18:17:17,653 INFO  L231             Difference]: Finished difference. Result has 262 places, 298 transitions, 3928 flow
[2024-06-04 18:17:17,653 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3928, PETRI_PLACES=262, PETRI_TRANSITIONS=298}
[2024-06-04 18:17:17,653 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places.
[2024-06-04 18:17:17,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 298 transitions, 3928 flow
[2024-06-04 18:17:17,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:17,654 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:17,654 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:17,654 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 18:17:17,654 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:17,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:17,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -332385069, now seen corresponding path program 1 times
[2024-06-04 18:17:17,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:17,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837920369]
[2024-06-04 18:17:17,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:17,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:17,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:29,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:29,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:29,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837920369]
[2024-06-04 18:17:29,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837920369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:29,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:29,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:29,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160521729]
[2024-06-04 18:17:29,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:29,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:29,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:29,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:29,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:29,166 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:17:29,166 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 298 transitions, 3928 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:29,166 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:29,166 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:17:29,166 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:31,238 INFO  L124   PetriNetUnfolderBase]: 3627/5569 cut-off events.
[2024-06-04 18:17:31,239 INFO  L125   PetriNetUnfolderBase]: For 502229/502229 co-relation queries the response was YES.
[2024-06-04 18:17:31,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45231 conditions, 5569 events. 3627/5569 cut-off events. For 502229/502229 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 30654 event pairs, 934 based on Foata normal form. 3/5572 useless extension candidates. Maximal degree in co-relation 45104. Up to 5430 conditions per place. 
[2024-06-04 18:17:31,294 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 290 selfloop transitions, 42 changer transitions 0/335 dead transitions.
[2024-06-04 18:17:31,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 335 transitions, 4992 flow
[2024-06-04 18:17:31,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:31,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:31,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-04 18:17:31,295 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-04 18:17:31,295 INFO  L175             Difference]: Start difference. First operand has 262 places, 298 transitions, 3928 flow. Second operand 9 states and 147 transitions.
[2024-06-04 18:17:31,295 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 335 transitions, 4992 flow
[2024-06-04 18:17:32,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 335 transitions, 4849 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:32,180 INFO  L231             Difference]: Finished difference. Result has 267 places, 306 transitions, 4033 flow
[2024-06-04 18:17:32,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3785, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4033, PETRI_PLACES=267, PETRI_TRANSITIONS=306}
[2024-06-04 18:17:32,181 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 224 predicate places.
[2024-06-04 18:17:32,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 306 transitions, 4033 flow
[2024-06-04 18:17:32,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:32,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:32,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:32,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 18:17:32,181 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:32,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:32,182 INFO  L85        PathProgramCache]: Analyzing trace with hash -198465717, now seen corresponding path program 2 times
[2024-06-04 18:17:32,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:32,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499192748]
[2024-06-04 18:17:32,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:32,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:32,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:43,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-04 18:17:43,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:43,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499192748]
[2024-06-04 18:17:43,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499192748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:43,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:43,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:43,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331556344]
[2024-06-04 18:17:43,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:43,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:43,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:43,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:43,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:43,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 18:17:43,263 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 306 transitions, 4033 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:43,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:43,263 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 18:17:43,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:45,488 INFO  L124   PetriNetUnfolderBase]: 3642/5590 cut-off events.
[2024-06-04 18:17:45,489 INFO  L125   PetriNetUnfolderBase]: For 512981/512981 co-relation queries the response was YES.
[2024-06-04 18:17:45,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45967 conditions, 5590 events. 3642/5590 cut-off events. For 512981/512981 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30789 event pairs, 939 based on Foata normal form. 3/5593 useless extension candidates. Maximal degree in co-relation 45837. Up to 5514 conditions per place. 
[2024-06-04 18:17:45,536 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 300 selfloop transitions, 27 changer transitions 0/330 dead transitions.
[2024-06-04 18:17:45,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 330 transitions, 4856 flow
[2024-06-04 18:17:45,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:45,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:45,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-04 18:17:45,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37202380952380953
[2024-06-04 18:17:45,537 INFO  L175             Difference]: Start difference. First operand has 267 places, 306 transitions, 4033 flow. Second operand 8 states and 125 transitions.
[2024-06-04 18:17:45,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 330 transitions, 4856 flow
[2024-06-04 18:17:46,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 330 transitions, 4740 flow, removed 38 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:46,135 INFO  L231             Difference]: Finished difference. Result has 270 places, 310 transitions, 4066 flow
[2024-06-04 18:17:46,136 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3925, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4066, PETRI_PLACES=270, PETRI_TRANSITIONS=310}
[2024-06-04 18:17:46,136 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 227 predicate places.
[2024-06-04 18:17:46,136 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 310 transitions, 4066 flow
[2024-06-04 18:17:46,136 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:46,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:46,136 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:46,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 18:17:46,136 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:46,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:46,137 INFO  L85        PathProgramCache]: Analyzing trace with hash -831082122, now seen corresponding path program 1 times
[2024-06-04 18:17:46,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:46,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789107911]
[2024-06-04 18:17:46,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:46,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:46,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15