./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe032_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/safe032_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 cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe032_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-cde23df-m
[2024-06-14 16:08:56,769 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 16:08:56,847 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 16:08:56,851 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 16:08:56,851 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 16:08:56,867 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 16:08:56,867 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 16:08:56,868 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 16:08:56,868 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 16:08:56,872 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 16:08:56,872 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 16:08:56,872 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 16:08:56,873 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 16:08:56,874 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 16:08:56,874 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 16:08:56,874 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 16:08:56,875 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 16:08:56,875 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 16:08:56,875 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 16:08:56,875 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 16:08:56,875 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 16:08:56,876 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 16:08:56,876 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 16:08:56,876 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 16:08:56,876 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 16:08:56,877 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 16:08:56,877 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 16:08:56,877 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 16:08:56,878 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 16:08:56,878 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 16:08:56,879 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 16:08:56,879 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 16:08:56,879 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 16:08:56,879 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 16:08:56,879 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 16:08:56,880 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 16:08:56,880 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 16:08:56,880 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 16:08:56,880 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 16:08:56,880 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 16:08:56,881 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 16:08:56,881 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 16:08:56,881 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 16:08:56,881 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 16:08:57,066 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 16:08:57,083 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 16:08:57,086 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 16:08:57,087 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 16:08:57,087 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 16:08:57,089 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-14 16:08:57,268 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 16:08:57,269 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 16:08:57,270 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 16:08:58,411 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 16:08:58,687 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 16:08:58,690 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 16:08:58,706 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c89af4/07a3f5870ba04326980cee1851299849/FLAGdf910c6d3
[2024-06-14 16:08:58,717 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c89af4/07a3f5870ba04326980cee1851299849
[2024-06-14 16:08:58,717 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 16:08:58,719 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 16:08:58,721 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 16:08:58,721 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 16:08:58,726 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 16:08:58,726 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:57" (1/2) ...
[2024-06-14 16:08:58,727 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cabf3a6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:58, skipping insertion in model container
[2024-06-14 16:08:58,727 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:57" (1/2) ...
[2024-06-14 16:08:58,729 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c4bd2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:58, skipping insertion in model container
[2024-06-14 16:08:58,729 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:08:58" (2/2) ...
[2024-06-14 16:08:58,729 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cabf3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:58, skipping insertion in model container
[2024-06-14 16:08:58,730 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:08:58" (2/2) ...
[2024-06-14 16:08:58,730 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 16:08:58,816 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 16:08:58,817 INFO  L97    edCorrectnessWitness]: Location invariant before [L852-L852] (((((((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-14 16:08:58,818 INFO  L97    edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-14 16:08:58,818 INFO  L97    edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-14 16:08:58,819 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 16:08:58,819 INFO  L106   edCorrectnessWitness]: ghost_update [L850-L850] multithreaded = 1;
[2024-06-14 16:08:58,864 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 16:08:59,154 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 16:08:59,162 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 16:08:59,475 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 16:08:59,563 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 16:08:59,563 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59 WrapperNode
[2024-06-14 16:08:59,564 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 16:08:59,565 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 16:08:59,565 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 16:08:59,565 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 16:08:59,571 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,615 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,743 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-14 16:08:59,743 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 16:08:59,745 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 16:08:59,745 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 16:08:59,745 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 16:08:59,754 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,754 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,783 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,830 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 16:08:59,831 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,831 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,868 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,870 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,883 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,889 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,905 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 16:08:59,906 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 16:08:59,906 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 16:08:59,906 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 16:08:59,907 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (1/1) ...
[2024-06-14 16:08:59,912 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 16:08:59,923 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 16:08:59,936 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 16:08:59,956 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 16:08:59,967 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 16:08:59,968 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 16:08:59,968 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 16:08:59,968 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 16:08:59,968 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 16:08:59,968 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 16:08:59,969 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 16:08:59,969 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 16:08:59,969 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 16:08:59,969 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 16:08:59,969 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 16:08:59,969 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 16:08:59,970 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 16:09:00,099 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 16:09:00,101 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 16:09:01,261 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 16:09:01,261 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 16:09:01,556 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 16:09:01,557 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 16:09:01,557 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:09:01 BoogieIcfgContainer
[2024-06-14 16:09:01,557 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 16:09:01,561 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 16:09:01,561 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 16:09:01,564 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 16:09:01,564 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:57" (1/4) ...
[2024-06-14 16:09:01,564 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcda9ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:09:01, skipping insertion in model container
[2024-06-14 16:09:01,565 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:08:58" (2/4) ...
[2024-06-14 16:09:01,565 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcda9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:09:01, skipping insertion in model container
[2024-06-14 16:09:01,565 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:59" (3/4) ...
[2024-06-14 16:09:01,566 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcda9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:09:01, skipping insertion in model container
[2024-06-14 16:09:01,566 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:09:01" (4/4) ...
[2024-06-14 16:09:01,567 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 16:09:01,580 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 16:09:01,581 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 16:09:01,581 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 16:09:01,687 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 16:09:01,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-14 16:09:01,761 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-14 16:09:01,761 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 16:09:01,764 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 16:09:01,764 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-14 16:09:01,768 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-14 16:09:01,779 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 16:09:01,786 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;@2571e603, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 16:09:01,786 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 16:09:01,792 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 16:09:01,792 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-14 16:09:01,793 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 16:09:01,793 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:01,793 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:01,794 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:01,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:01,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 828948054, now seen corresponding path program 1 times
[2024-06-14 16:09:01,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:01,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187574455]
[2024-06-14 16:09:01,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:01,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:02,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:06,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:06,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:06,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187574455]
[2024-06-14 16:09:06,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187574455] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:06,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:06,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 16:09:06,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477949544]
[2024-06-14 16:09:06,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:06,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 16:09:06,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:06,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 16:09:06,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 16:09:06,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 16:09:06,887 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:06,887 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:06,887 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 16:09:06,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:07,785 INFO  L124   PetriNetUnfolderBase]: 1602/2411 cut-off events.
[2024-06-14 16:09:07,785 INFO  L125   PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES.
[2024-06-14 16:09:07,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 2411 events. 1602/2411 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11657 event pairs, 1117 based on Foata normal form. 1/2370 useless extension candidates. Maximal degree in co-relation 4875. Up to 2382 conditions per place. 
[2024-06-14 16:09:07,802 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 35 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-14 16:09:07,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 181 flow
[2024-06-14 16:09:07,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 16:09:07,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 16:09:07,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2024-06-14 16:09:07,812 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5581395348837209
[2024-06-14 16:09:07,813 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 72 transitions.
[2024-06-14 16:09:07,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 181 flow
[2024-06-14 16:09:07,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 16:09:07,819 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-14 16:09:07,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-14 16:09:07,822 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-14 16:09:07,823 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-14 16:09:07,823 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:07,823 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:07,823 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:07,823 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 16:09:07,823 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:07,825 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:07,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 2050174005, now seen corresponding path program 1 times
[2024-06-14 16:09:07,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:07,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476464278]
[2024-06-14 16:09:07,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:07,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:07,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:11,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:11,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:11,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476464278]
[2024-06-14 16:09:11,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476464278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:11,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:11,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 16:09:11,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995946422]
[2024-06-14 16:09:11,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:11,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 16:09:11,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:11,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 16:09:11,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 16:09:11,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 16:09:11,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:11,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:11,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 16:09:11,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:12,299 INFO  L124   PetriNetUnfolderBase]: 1596/2402 cut-off events.
[2024-06-14 16:09:12,300 INFO  L125   PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES.
[2024-06-14 16:09:12,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 2402 events. 1596/2402 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11678 event pairs, 949 based on Foata normal form. 3/2402 useless extension candidates. Maximal degree in co-relation 5480. Up to 2358 conditions per place. 
[2024-06-14 16:09:12,312 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 42 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-14 16:09:12,312 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 248 flow
[2024-06-14 16:09:12,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 16:09:12,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 16:09:12,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-14 16:09:12,316 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5348837209302325
[2024-06-14 16:09:12,316 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 92 transitions.
[2024-06-14 16:09:12,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 248 flow
[2024-06-14 16:09:12,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 16:09:12,320 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-14 16:09:12,320 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40}
[2024-06-14 16:09:12,321 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-14 16:09:12,321 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-14 16:09:12,322 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:12,322 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:12,322 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:12,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 16:09:12,324 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:12,325 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:12,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -1172724204, now seen corresponding path program 1 times
[2024-06-14 16:09:12,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:12,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135411520]
[2024-06-14 16:09:12,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:12,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:12,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:16,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:16,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:16,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135411520]
[2024-06-14 16:09:16,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135411520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:16,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:16,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 16:09:16,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091406469]
[2024-06-14 16:09:16,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:16,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 16:09:16,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:16,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 16:09:16,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 16:09:16,637 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 16:09:16,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:16,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:16,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 16:09:16,638 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:17,541 INFO  L124   PetriNetUnfolderBase]: 1590/2393 cut-off events.
[2024-06-14 16:09:17,541 INFO  L125   PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES.
[2024-06-14 16:09:17,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6083 conditions, 2393 events. 1590/2393 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11669 event pairs, 781 based on Foata normal form. 3/2393 useless extension candidates. Maximal degree in co-relation 6066. Up to 2334 conditions per place. 
[2024-06-14 16:09:17,552 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 49 selfloop transitions, 10 changer transitions 0/64 dead transitions.
[2024-06-14 16:09:17,552 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 326 flow
[2024-06-14 16:09:17,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:09:17,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:09:17,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions.
[2024-06-14 16:09:17,555 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5209302325581395
[2024-06-14 16:09:17,555 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 112 transitions.
[2024-06-14 16:09:17,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 326 flow
[2024-06-14 16:09:17,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 16:09:17,557 INFO  L231             Difference]: Finished difference. Result has 50 places, 43 transitions, 176 flow
[2024-06-14 16:09:17,557 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=43}
[2024-06-14 16:09:17,558 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places.
[2024-06-14 16:09:17,558 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 176 flow
[2024-06-14 16:09:17,558 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:17,558 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:17,559 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:17,559 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 16:09:17,559 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-14 16:09:17,559 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:17,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 1463193299, now seen corresponding path program 1 times
[2024-06-14 16:09:17,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:17,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786238500]
[2024-06-14 16:09:17,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:17,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:17,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:26,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:26,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:26,980 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786238500]
[2024-06-14 16:09:26,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786238500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:26,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:26,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:09:26,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020564184]
[2024-06-14 16:09:26,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:26,981 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:09:26,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:26,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:09:26,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:09:27,070 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:09:27,071 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 176 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:27,071 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:27,072 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:09:27,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:28,141 INFO  L124   PetriNetUnfolderBase]: 1580/2379 cut-off events.
[2024-06-14 16:09:28,142 INFO  L125   PetriNetUnfolderBase]: For 2411/2411 co-relation queries the response was YES.
[2024-06-14 16:09:28,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 2379 events. 1580/2379 cut-off events. For 2411/2411 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11525 event pairs, 745 based on Foata normal form. 4/2380 useless extension candidates. Maximal degree in co-relation 6620. Up to 2332 conditions per place. 
[2024-06-14 16:09:28,153 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 45 selfloop transitions, 8 changer transitions 0/58 dead transitions.
[2024-06-14 16:09:28,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 326 flow
[2024-06-14 16:09:28,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:09:28,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:09:28,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions.
[2024-06-14 16:09:28,156 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4372093023255814
[2024-06-14 16:09:28,156 INFO  L175             Difference]: Start difference. First operand has 50 places, 43 transitions, 176 flow. Second operand 5 states and 94 transitions.
[2024-06-14 16:09:28,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 326 flow
[2024-06-14 16:09:28,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 302 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 16:09:28,161 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 196 flow
[2024-06-14 16:09:28,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-14 16:09:28,163 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places.
[2024-06-14 16:09:28,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 196 flow
[2024-06-14 16:09:28,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:28,164 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:28,164 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:28,164 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 16:09:28,164 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-14 16:09:28,164 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:28,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1706480653, now seen corresponding path program 1 times
[2024-06-14 16:09:28,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:28,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955868770]
[2024-06-14 16:09:28,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:28,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:28,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:32,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:32,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:32,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955868770]
[2024-06-14 16:09:32,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955868770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:32,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:32,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:09:32,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899374274]
[2024-06-14 16:09:32,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:32,966 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:09:32,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:32,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:09:32,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:09:33,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 16:09:33,080 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 196 flow. Second operand  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-14 16:09:33,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:33,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 16:09:33,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:34,047 INFO  L124   PetriNetUnfolderBase]: 1571/2364 cut-off events.
[2024-06-14 16:09:34,048 INFO  L125   PetriNetUnfolderBase]: For 3708/3708 co-relation queries the response was YES.
[2024-06-14 16:09:34,052 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 2364 events. 1571/2364 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11545 event pairs, 568 based on Foata normal form. 6/2367 useless extension candidates. Maximal degree in co-relation 7111. Up to 2275 conditions per place. 
[2024-06-14 16:09:34,062 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 56 selfloop transitions, 12 changer transitions 0/73 dead transitions.
[2024-06-14 16:09:34,062 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 408 flow
[2024-06-14 16:09:34,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:34,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:34,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-14 16:09:34,067 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49612403100775193
[2024-06-14 16:09:34,067 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 196 flow. Second operand 6 states and 128 transitions.
[2024-06-14 16:09:34,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 408 flow
[2024-06-14 16:09:34,074 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 388 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 16:09:34,076 INFO  L231             Difference]: Finished difference. Result has 54 places, 47 transitions, 221 flow
[2024-06-14 16:09:34,076 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=47}
[2024-06-14 16:09:34,079 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places.
[2024-06-14 16:09:34,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 221 flow
[2024-06-14 16:09:34,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-14 16:09:34,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:34,080 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:34,081 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 16:09:34,081 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:34,081 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:34,081 INFO  L85        PathProgramCache]: Analyzing trace with hash 1674246868, now seen corresponding path program 1 times
[2024-06-14 16:09:34,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:34,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910397419]
[2024-06-14 16:09:34,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:34,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:34,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:44,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:44,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:44,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910397419]
[2024-06-14 16:09:44,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910397419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:44,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:44,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:09:44,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157155221]
[2024-06-14 16:09:44,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:44,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:09:44,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:44,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:09:44,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:09:44,541 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:09:44,541 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 221 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-14 16:09:44,541 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:44,541 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:09:44,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:45,664 INFO  L124   PetriNetUnfolderBase]: 1593/2407 cut-off events.
[2024-06-14 16:09:45,664 INFO  L125   PetriNetUnfolderBase]: For 5458/5458 co-relation queries the response was YES.
[2024-06-14 16:09:45,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7657 conditions, 2407 events. 1593/2407 cut-off events. For 5458/5458 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11838 event pairs, 672 based on Foata normal form. 4/2406 useless extension candidates. Maximal degree in co-relation 7637. Up to 2287 conditions per place. 
[2024-06-14 16:09:45,676 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 55 selfloop transitions, 16 changer transitions 0/76 dead transitions.
[2024-06-14 16:09:45,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 479 flow
[2024-06-14 16:09:45,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:45,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:45,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-14 16:09:45,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-14 16:09:45,677 INFO  L175             Difference]: Start difference. First operand has 54 places, 47 transitions, 221 flow. Second operand 6 states and 118 transitions.
[2024-06-14 16:09:45,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 479 flow
[2024-06-14 16:09:45,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 444 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-14 16:09:45,682 INFO  L231             Difference]: Finished difference. Result has 56 places, 53 transitions, 272 flow
[2024-06-14 16:09:45,682 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=53}
[2024-06-14 16:09:45,685 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places.
[2024-06-14 16:09:45,685 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 272 flow
[2024-06-14 16:09:45,685 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-14 16:09:45,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:45,685 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:45,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 16:09:45,686 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:45,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:45,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -2133400428, now seen corresponding path program 2 times
[2024-06-14 16:09:45,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:45,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841358863]
[2024-06-14 16:09:45,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:45,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:45,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:55,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:55,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:55,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841358863]
[2024-06-14 16:09:55,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841358863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:55,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:55,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:09:55,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758665518]
[2024-06-14 16:09:55,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:55,998 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:09:55,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:55,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:09:55,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:09:56,119 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:09:56,119 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 272 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-14 16:09:56,119 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:56,119 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:09:56,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:57,175 INFO  L124   PetriNetUnfolderBase]: 1583/2387 cut-off events.
[2024-06-14 16:09:57,175 INFO  L125   PetriNetUnfolderBase]: For 7414/7414 co-relation queries the response was YES.
[2024-06-14 16:09:57,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8127 conditions, 2387 events. 1583/2387 cut-off events. For 7414/7414 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11757 event pairs, 671 based on Foata normal form. 4/2385 useless extension candidates. Maximal degree in co-relation 8105. Up to 2279 conditions per place. 
[2024-06-14 16:09:57,186 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 49 selfloop transitions, 16 changer transitions 0/70 dead transitions.
[2024-06-14 16:09:57,186 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 444 flow
[2024-06-14 16:09:57,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:57,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:57,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-14 16:09:57,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43410852713178294
[2024-06-14 16:09:57,187 INFO  L175             Difference]: Start difference. First operand has 56 places, 53 transitions, 272 flow. Second operand 6 states and 112 transitions.
[2024-06-14 16:09:57,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 444 flow
[2024-06-14 16:09:57,190 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 412 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-14 16:09:57,191 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 280 flow
[2024-06-14 16:09:57,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=60, PETRI_TRANSITIONS=53}
[2024-06-14 16:09:57,191 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places.
[2024-06-14 16:09:57,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 280 flow
[2024-06-14 16:09:57,192 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-14 16:09:57,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:57,192 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:57,192 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 16:09:57,192 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:57,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:57,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1674492946, now seen corresponding path program 1 times
[2024-06-14 16:09:57,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:57,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353449069]
[2024-06-14 16:09:57,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:57,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:57,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:05,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:05,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:05,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353449069]
[2024-06-14 16:10:05,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353449069] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:05,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:05,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:10:05,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290661093]
[2024-06-14 16:10:05,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:05,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:10:05,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:05,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:10:05,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:10:05,859 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:10:05,859 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 280 flow. Second operand  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:05,859 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:05,859 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:10:05,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:06,846 INFO  L124   PetriNetUnfolderBase]: 1573/2378 cut-off events.
[2024-06-14 16:10:06,846 INFO  L125   PetriNetUnfolderBase]: For 8860/8860 co-relation queries the response was YES.
[2024-06-14 16:10:06,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8327 conditions, 2378 events. 1573/2378 cut-off events. For 8860/8860 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11663 event pairs, 643 based on Foata normal form. 4/2379 useless extension candidates. Maximal degree in co-relation 8303. Up to 2303 conditions per place. 
[2024-06-14 16:10:06,857 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 57 selfloop transitions, 11 changer transitions 0/73 dead transitions.
[2024-06-14 16:10:06,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 480 flow
[2024-06-14 16:10:06,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:10:06,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:10:06,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-14 16:10:06,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4263565891472868
[2024-06-14 16:10:06,859 INFO  L175             Difference]: Start difference. First operand has 60 places, 53 transitions, 280 flow. Second operand 6 states and 110 transitions.
[2024-06-14 16:10:06,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 480 flow
[2024-06-14 16:10:06,862 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 440 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:06,863 INFO  L231             Difference]: Finished difference. Result has 61 places, 56 transitions, 298 flow
[2024-06-14 16:10:06,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=61, PETRI_TRANSITIONS=56}
[2024-06-14 16:10:06,863 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places.
[2024-06-14 16:10:06,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 298 flow
[2024-06-14 16:10:06,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:06,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:06,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:06,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 16:10:06,864 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:06,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:06,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -247679903, now seen corresponding path program 1 times
[2024-06-14 16:10:06,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:06,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867960999]
[2024-06-14 16:10:06,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:06,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:06,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:16,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:16,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:16,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867960999]
[2024-06-14 16:10:16,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867960999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:16,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:16,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:10:16,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863015939]
[2024-06-14 16:10:16,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:16,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:10:16,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:16,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:10:16,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:10:16,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:10:16,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 298 flow. Second operand  has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:16,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:16,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:10:16,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:16,938 INFO  L124   PetriNetUnfolderBase]: 1570/2369 cut-off events.
[2024-06-14 16:10:16,939 INFO  L125   PetriNetUnfolderBase]: For 10142/10142 co-relation queries the response was YES.
[2024-06-14 16:10:16,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8788 conditions, 2369 events. 1570/2369 cut-off events. For 10142/10142 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11531 event pairs, 683 based on Foata normal form. 1/2367 useless extension candidates. Maximal degree in co-relation 8763. Up to 2332 conditions per place. 
[2024-06-14 16:10:16,951 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 54 selfloop transitions, 8 changer transitions 0/67 dead transitions.
[2024-06-14 16:10:16,952 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 462 flow
[2024-06-14 16:10:16,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:10:16,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:10:16,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions.
[2024-06-14 16:10:16,953 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40930232558139534
[2024-06-14 16:10:16,953 INFO  L175             Difference]: Start difference. First operand has 61 places, 56 transitions, 298 flow. Second operand 5 states and 88 transitions.
[2024-06-14 16:10:16,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 462 flow
[2024-06-14 16:10:16,957 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 428 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 16:10:16,958 INFO  L231             Difference]: Finished difference. Result has 62 places, 59 transitions, 312 flow
[2024-06-14 16:10:16,958 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=62, PETRI_TRANSITIONS=59}
[2024-06-14 16:10:16,958 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places.
[2024-06-14 16:10:16,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 312 flow
[2024-06-14 16:10:16,959 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:16,959 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:16,959 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:16,959 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 16:10:16,959 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:16,959 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:16,960 INFO  L85        PathProgramCache]: Analyzing trace with hash 435779327, now seen corresponding path program 1 times
[2024-06-14 16:10:16,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:16,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575757732]
[2024-06-14 16:10:16,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:16,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:17,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:25,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:25,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:25,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575757732]
[2024-06-14 16:10:25,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575757732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:25,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:25,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:25,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930820121]
[2024-06-14 16:10:25,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:25,275 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:25,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:25,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:25,280 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:25,470 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:10:25,471 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 312 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:25,471 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:25,471 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:10:25,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:26,625 INFO  L124   PetriNetUnfolderBase]: 1592/2416 cut-off events.
[2024-06-14 16:10:26,625 INFO  L125   PetriNetUnfolderBase]: For 12286/12286 co-relation queries the response was YES.
[2024-06-14 16:10:26,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 2416 events. 1592/2416 cut-off events. For 12286/12286 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11923 event pairs, 670 based on Foata normal form. 4/2417 useless extension candidates. Maximal degree in co-relation 9317. Up to 2319 conditions per place. 
[2024-06-14 16:10:26,636 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 69 selfloop transitions, 14 changer transitions 0/88 dead transitions.
[2024-06-14 16:10:26,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 570 flow
[2024-06-14 16:10:26,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:10:26,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:10:26,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-14 16:10:26,639 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43521594684385384
[2024-06-14 16:10:26,639 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 312 flow. Second operand 7 states and 131 transitions.
[2024-06-14 16:10:26,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 570 flow
[2024-06-14 16:10:26,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 544 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-14 16:10:26,644 INFO  L231             Difference]: Finished difference. Result has 66 places, 62 transitions, 354 flow
[2024-06-14 16:10:26,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=66, PETRI_TRANSITIONS=62}
[2024-06-14 16:10:26,645 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places.
[2024-06-14 16:10:26,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 354 flow
[2024-06-14 16:10:26,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:26,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:26,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:26,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 16:10:26,646 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:26,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:26,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 745473075, now seen corresponding path program 2 times
[2024-06-14 16:10:26,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:26,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776904874]
[2024-06-14 16:10:26,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:26,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:26,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:34,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:34,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:34,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776904874]
[2024-06-14 16:10:34,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776904874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:34,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:34,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:34,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610700374]
[2024-06-14 16:10:34,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:34,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:34,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:34,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:34,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:34,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:10:34,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 354 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:34,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:34,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:10:34,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:35,731 INFO  L124   PetriNetUnfolderBase]: 1614/2459 cut-off events.
[2024-06-14 16:10:35,731 INFO  L125   PetriNetUnfolderBase]: For 15140/15140 co-relation queries the response was YES.
[2024-06-14 16:10:35,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10077 conditions, 2459 events. 1614/2459 cut-off events. For 15140/15140 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12212 event pairs, 620 based on Foata normal form. 4/2458 useless extension candidates. Maximal degree in co-relation 10050. Up to 2240 conditions per place. 
[2024-06-14 16:10:35,744 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 65 selfloop transitions, 26 changer transitions 0/96 dead transitions.
[2024-06-14 16:10:35,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 706 flow
[2024-06-14 16:10:35,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:10:35,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:10:35,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 16:10:35,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45514950166112955
[2024-06-14 16:10:35,747 INFO  L175             Difference]: Start difference. First operand has 66 places, 62 transitions, 354 flow. Second operand 7 states and 137 transitions.
[2024-06-14 16:10:35,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 706 flow
[2024-06-14 16:10:35,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 662 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:35,754 INFO  L231             Difference]: Finished difference. Result has 68 places, 68 transitions, 440 flow
[2024-06-14 16:10:35,754 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=68, PETRI_TRANSITIONS=68}
[2024-06-14 16:10:35,755 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places.
[2024-06-14 16:10:35,755 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 440 flow
[2024-06-14 16:10:35,755 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:35,755 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:35,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:35,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 16:10:35,756 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:35,756 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:35,756 INFO  L85        PathProgramCache]: Analyzing trace with hash -7335515, now seen corresponding path program 1 times
[2024-06-14 16:10:35,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:35,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201855861]
[2024-06-14 16:10:35,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:35,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:35,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:44,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:44,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:44,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201855861]
[2024-06-14 16:10:44,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201855861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:44,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:44,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:44,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068853703]
[2024-06-14 16:10:44,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:44,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:44,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:44,927 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:44,927 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:45,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:10:45,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 440 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:45,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:45,031 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:10:45,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:46,160 INFO  L124   PetriNetUnfolderBase]: 1636/2491 cut-off events.
[2024-06-14 16:10:46,160 INFO  L125   PetriNetUnfolderBase]: For 18827/18827 co-relation queries the response was YES.
[2024-06-14 16:10:46,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10773 conditions, 2491 events. 1636/2491 cut-off events. For 18827/18827 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12369 event pairs, 586 based on Foata normal form. 4/2490 useless extension candidates. Maximal degree in co-relation 10745. Up to 2287 conditions per place. 
[2024-06-14 16:10:46,172 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 79 selfloop transitions, 24 changer transitions 0/108 dead transitions.
[2024-06-14 16:10:46,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 830 flow
[2024-06-14 16:10:46,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:10:46,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:10:46,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 16:10:46,175 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-14 16:10:46,175 INFO  L175             Difference]: Start difference. First operand has 68 places, 68 transitions, 440 flow. Second operand 8 states and 154 transitions.
[2024-06-14 16:10:46,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 830 flow
[2024-06-14 16:10:46,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 788 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-14 16:10:46,184 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 520 flow
[2024-06-14 16:10:46,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2024-06-14 16:10:46,185 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places.
[2024-06-14 16:10:46,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 520 flow
[2024-06-14 16:10:46,185 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:46,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:46,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:46,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 16:10:46,186 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:46,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:46,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -1498379661, now seen corresponding path program 3 times
[2024-06-14 16:10:46,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:46,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510312785]
[2024-06-14 16:10:46,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:46,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:46,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:54,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:54,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:54,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510312785]
[2024-06-14 16:10:54,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510312785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:54,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:54,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:54,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576446375]
[2024-06-14 16:10:54,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:54,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:54,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:54,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:54,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:54,222 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:10:54,222 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 520 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:54,222 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:54,222 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:10:54,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:55,333 INFO  L124   PetriNetUnfolderBase]: 1626/2466 cut-off events.
[2024-06-14 16:10:55,333 INFO  L125   PetriNetUnfolderBase]: For 21698/21698 co-relation queries the response was YES.
[2024-06-14 16:10:55,339 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11233 conditions, 2466 events. 1626/2466 cut-off events. For 21698/21698 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12196 event pairs, 573 based on Foata normal form. 4/2461 useless extension candidates. Maximal degree in co-relation 11203. Up to 2264 conditions per place. 
[2024-06-14 16:10:55,349 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 65 selfloop transitions, 26 changer transitions 0/96 dead transitions.
[2024-06-14 16:10:55,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 96 transitions, 756 flow
[2024-06-14 16:10:55,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:10:55,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:10:55,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-14 16:10:55,351 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43521594684385384
[2024-06-14 16:10:55,352 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 520 flow. Second operand 7 states and 131 transitions.
[2024-06-14 16:10:55,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 96 transitions, 756 flow
[2024-06-14 16:10:55,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 700 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-06-14 16:10:55,363 INFO  L231             Difference]: Finished difference. Result has 76 places, 74 transitions, 524 flow
[2024-06-14 16:10:55,363 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=76, PETRI_TRANSITIONS=74}
[2024-06-14 16:10:55,364 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places.
[2024-06-14 16:10:55,364 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 524 flow
[2024-06-14 16:10:55,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:55,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:55,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:55,365 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 16:10:55,365 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:55,365 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:55,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -1965733773, now seen corresponding path program 2 times
[2024-06-14 16:10:55,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:55,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365120715]
[2024-06-14 16:10:55,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:55,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:55,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:05,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:05,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:05,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365120715]
[2024-06-14 16:11:05,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365120715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:05,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:05,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:05,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051837866]
[2024-06-14 16:11:05,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:05,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:05,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:05,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:05,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:05,620 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:11:05,620 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 524 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:05,620 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:05,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:11:05,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:06,904 INFO  L124   PetriNetUnfolderBase]: 1648/2518 cut-off events.
[2024-06-14 16:11:06,904 INFO  L125   PetriNetUnfolderBase]: For 24531/24531 co-relation queries the response was YES.
[2024-06-14 16:11:06,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11662 conditions, 2518 events. 1648/2518 cut-off events. For 24531/24531 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12579 event pairs, 576 based on Foata normal form. 4/2519 useless extension candidates. Maximal degree in co-relation 11630. Up to 2292 conditions per place. 
[2024-06-14 16:11:06,915 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 82 selfloop transitions, 28 changer transitions 0/115 dead transitions.
[2024-06-14 16:11:06,915 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 922 flow
[2024-06-14 16:11:06,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:06,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:06,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 16:11:06,918 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392764857881137
[2024-06-14 16:11:06,918 INFO  L175             Difference]: Start difference. First operand has 76 places, 74 transitions, 524 flow. Second operand 9 states and 170 transitions.
[2024-06-14 16:11:06,918 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 922 flow
[2024-06-14 16:11:06,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 115 transitions, 852 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-14 16:11:06,930 INFO  L231             Difference]: Finished difference. Result has 79 places, 77 transitions, 554 flow
[2024-06-14 16:11:06,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=554, PETRI_PLACES=79, PETRI_TRANSITIONS=77}
[2024-06-14 16:11:06,941 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places.
[2024-06-14 16:11:06,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 554 flow
[2024-06-14 16:11:06,941 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:06,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:06,942 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:06,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 16:11:06,942 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:06,942 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:06,942 INFO  L85        PathProgramCache]: Analyzing trace with hash -1424985423, now seen corresponding path program 3 times
[2024-06-14 16:11:06,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:06,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117661185]
[2024-06-14 16:11:06,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:06,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:07,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:16,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:16,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:16,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117661185]
[2024-06-14 16:11:16,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117661185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:16,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:16,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:11:16,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461095988]
[2024-06-14 16:11:16,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:16,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:11:16,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:16,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:11:16,231 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:11:16,362 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:11:16,362 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 554 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:16,362 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:16,362 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:11:16,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:17,521 INFO  L124   PetriNetUnfolderBase]: 1638/2504 cut-off events.
[2024-06-14 16:11:17,521 INFO  L125   PetriNetUnfolderBase]: For 26982/26982 co-relation queries the response was YES.
[2024-06-14 16:11:17,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11772 conditions, 2504 events. 1638/2504 cut-off events. For 26982/26982 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12463 event pairs, 576 based on Foata normal form. 4/2505 useless extension candidates. Maximal degree in co-relation 11739. Up to 2284 conditions per place. 
[2024-06-14 16:11:17,534 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 77 selfloop transitions, 29 changer transitions 0/111 dead transitions.
[2024-06-14 16:11:17,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 850 flow
[2024-06-14 16:11:17,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:17,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:17,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-14 16:11:17,535 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42377260981912146
[2024-06-14 16:11:17,535 INFO  L175             Difference]: Start difference. First operand has 79 places, 77 transitions, 554 flow. Second operand 9 states and 164 transitions.
[2024-06-14 16:11:17,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 850 flow
[2024-06-14 16:11:17,551 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 750 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-14 16:11:17,552 INFO  L231             Difference]: Finished difference. Result has 81 places, 77 transitions, 520 flow
[2024-06-14 16:11:17,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=81, PETRI_TRANSITIONS=77}
[2024-06-14 16:11:17,554 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places.
[2024-06-14 16:11:17,554 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 520 flow
[2024-06-14 16:11:17,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:17,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:17,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:17,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 16:11:17,554 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:17,555 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:17,555 INFO  L85        PathProgramCache]: Analyzing trace with hash -1424974511, now seen corresponding path program 1 times
[2024-06-14 16:11:17,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:17,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938751815]
[2024-06-14 16:11:17,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:17,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:17,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:28,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:28,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:28,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938751815]
[2024-06-14 16:11:28,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938751815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:28,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:28,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:28,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613263623]
[2024-06-14 16:11:28,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:28,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:28,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:28,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:28,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:28,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:11:28,781 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 520 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:11:28,781 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:28,781 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:11:28,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:29,938 INFO  L124   PetriNetUnfolderBase]: 1630/2492 cut-off events.
[2024-06-14 16:11:29,939 INFO  L125   PetriNetUnfolderBase]: For 29127/29127 co-relation queries the response was YES.
[2024-06-14 16:11:29,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11786 conditions, 2492 events. 1630/2492 cut-off events. For 29127/29127 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12368 event pairs, 592 based on Foata normal form. 4/2493 useless extension candidates. Maximal degree in co-relation 11752. Up to 2369 conditions per place. 
[2024-06-14 16:11:29,952 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 83 selfloop transitions, 13 changer transitions 0/101 dead transitions.
[2024-06-14 16:11:29,952 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 798 flow
[2024-06-14 16:11:29,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:11:29,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:11:29,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 16:11:29,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186046511627907
[2024-06-14 16:11:29,955 INFO  L175             Difference]: Start difference. First operand has 81 places, 77 transitions, 520 flow. Second operand 7 states and 126 transitions.
[2024-06-14 16:11:29,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 798 flow
[2024-06-14 16:11:29,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 101 transitions, 730 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-14 16:11:29,981 INFO  L231             Difference]: Finished difference. Result has 80 places, 79 transitions, 521 flow
[2024-06-14 16:11:29,996 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=80, PETRI_TRANSITIONS=79}
[2024-06-14 16:11:29,997 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places.
[2024-06-14 16:11:29,997 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 521 flow
[2024-06-14 16:11:29,997 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:11:29,997 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:29,997 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:29,997 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 16:11:29,997 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:29,998 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:29,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 911859405, now seen corresponding path program 1 times
[2024-06-14 16:11:29,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:29,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984290083]
[2024-06-14 16:11:29,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:29,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:30,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:39,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:39,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:39,733 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984290083]
[2024-06-14 16:11:39,733 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984290083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:39,733 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:39,733 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:11:39,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103385413]
[2024-06-14 16:11:39,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:39,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:11:39,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:39,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:11:39,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:11:39,848 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:11:39,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 521 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:11:39,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:39,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:11:39,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:40,797 INFO  L124   PetriNetUnfolderBase]: 1634/2490 cut-off events.
[2024-06-14 16:11:40,797 INFO  L125   PetriNetUnfolderBase]: For 32382/32382 co-relation queries the response was YES.
[2024-06-14 16:11:40,801 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12045 conditions, 2490 events. 1634/2490 cut-off events. For 32382/32382 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12249 event pairs, 647 based on Foata normal form. 2/2489 useless extension candidates. Maximal degree in co-relation 12010. Up to 2394 conditions per place. 
[2024-06-14 16:11:40,808 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 81 selfloop transitions, 18 changer transitions 0/104 dead transitions.
[2024-06-14 16:11:40,808 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 104 transitions, 853 flow
[2024-06-14 16:11:40,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:11:40,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:11:40,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:11:40,810 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119601328903654
[2024-06-14 16:11:40,810 INFO  L175             Difference]: Start difference. First operand has 80 places, 79 transitions, 521 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:11:40,810 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 104 transitions, 853 flow
[2024-06-14 16:11:40,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 802 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-14 16:11:40,825 INFO  L231             Difference]: Finished difference. Result has 83 places, 87 transitions, 593 flow
[2024-06-14 16:11:40,825 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=83, PETRI_TRANSITIONS=87}
[2024-06-14 16:11:40,825 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places.
[2024-06-14 16:11:40,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 593 flow
[2024-06-14 16:11:40,825 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:11:40,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:40,826 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:40,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 16:11:40,826 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:40,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:40,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -384601892, now seen corresponding path program 1 times
[2024-06-14 16:11:40,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:40,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917169521]
[2024-06-14 16:11:40,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:40,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:40,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:49,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:49,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:49,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917169521]
[2024-06-14 16:11:49,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917169521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:49,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:49,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:11:49,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924829751]
[2024-06-14 16:11:49,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:49,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:11:49,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:49,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:11:49,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:11:49,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:11:49,960 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 593 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:11:49,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:49,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:11:49,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:50,907 INFO  L124   PetriNetUnfolderBase]: 1639/2509 cut-off events.
[2024-06-14 16:11:50,907 INFO  L125   PetriNetUnfolderBase]: For 36497/36497 co-relation queries the response was YES.
[2024-06-14 16:11:50,911 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12729 conditions, 2509 events. 1639/2509 cut-off events. For 36497/36497 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12405 event pairs, 649 based on Foata normal form. 1/2507 useless extension candidates. Maximal degree in co-relation 12692. Up to 2418 conditions per place. 
[2024-06-14 16:11:50,919 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 89 selfloop transitions, 11 changer transitions 0/105 dead transitions.
[2024-06-14 16:11:50,919 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 865 flow
[2024-06-14 16:11:50,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:11:50,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:11:50,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 16:11:50,921 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41472868217054265
[2024-06-14 16:11:50,921 INFO  L175             Difference]: Start difference. First operand has 83 places, 87 transitions, 593 flow. Second operand 6 states and 107 transitions.
[2024-06-14 16:11:50,921 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 865 flow
[2024-06-14 16:11:50,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 821 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-14 16:11:50,950 INFO  L231             Difference]: Finished difference. Result has 86 places, 90 transitions, 617 flow
[2024-06-14 16:11:50,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=86, PETRI_TRANSITIONS=90}
[2024-06-14 16:11:50,951 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places.
[2024-06-14 16:11:50,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 617 flow
[2024-06-14 16:11:50,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:11:50,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:50,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:50,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 16:11:50,951 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:50,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:50,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797143552, now seen corresponding path program 2 times
[2024-06-14 16:11:50,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:50,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115969517]
[2024-06-14 16:11:50,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:50,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:50,994 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:00,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:00,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:00,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115969517]
[2024-06-14 16:12:00,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115969517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:00,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:00,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:12:00,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302964493]
[2024-06-14 16:12:00,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:00,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:12:00,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:00,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:12:00,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:12:00,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:12:00,386 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 617 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:12:00,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:00,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:12:00,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:01,353 INFO  L124   PetriNetUnfolderBase]: 1631/2498 cut-off events.
[2024-06-14 16:12:01,354 INFO  L125   PetriNetUnfolderBase]: For 39430/39430 co-relation queries the response was YES.
[2024-06-14 16:12:01,359 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12817 conditions, 2498 events. 1631/2498 cut-off events. For 39430/39430 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12300 event pairs, 649 based on Foata normal form. 2/2497 useless extension candidates. Maximal degree in co-relation 12778. Up to 2390 conditions per place. 
[2024-06-14 16:12:01,366 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 81 selfloop transitions, 20 changer transitions 0/106 dead transitions.
[2024-06-14 16:12:01,366 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 106 transitions, 859 flow
[2024-06-14 16:12:01,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:12:01,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:12:01,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 16:12:01,367 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40863787375415284
[2024-06-14 16:12:01,367 INFO  L175             Difference]: Start difference. First operand has 86 places, 90 transitions, 617 flow. Second operand 7 states and 123 transitions.
[2024-06-14 16:12:01,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 106 transitions, 859 flow
[2024-06-14 16:12:01,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 106 transitions, 817 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-14 16:12:01,385 INFO  L231             Difference]: Finished difference. Result has 89 places, 90 transitions, 623 flow
[2024-06-14 16:12:01,386 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=623, PETRI_PLACES=89, PETRI_TRANSITIONS=90}
[2024-06-14 16:12:01,386 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places.
[2024-06-14 16:12:01,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 623 flow
[2024-06-14 16:12:01,386 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:12:01,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:01,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:01,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 16:12:01,387 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:01,387 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:01,387 INFO  L85        PathProgramCache]: Analyzing trace with hash -1803802848, now seen corresponding path program 1 times
[2024-06-14 16:12:01,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:01,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529277648]
[2024-06-14 16:12:01,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:01,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:01,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:10,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:10,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:10,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529277648]
[2024-06-14 16:12:10,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529277648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:10,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:10,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:12:10,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41701252]
[2024-06-14 16:12:10,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:10,137 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:12:10,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:10,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:12:10,137 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:12:10,269 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:12:10,269 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 623 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:12:10,269 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:10,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:12:10,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:11,209 INFO  L124   PetriNetUnfolderBase]: 1641/2513 cut-off events.
[2024-06-14 16:12:11,210 INFO  L125   PetriNetUnfolderBase]: For 42439/42439 co-relation queries the response was YES.
[2024-06-14 16:12:11,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13082 conditions, 2513 events. 1641/2513 cut-off events. For 42439/42439 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12373 event pairs, 627 based on Foata normal form. 2/2511 useless extension candidates. Maximal degree in co-relation 13042. Up to 2415 conditions per place. 
[2024-06-14 16:12:11,221 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 90 selfloop transitions, 14 changer transitions 0/109 dead transitions.
[2024-06-14 16:12:11,221 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 908 flow
[2024-06-14 16:12:11,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:12:11,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:12:11,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 16:12:11,222 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4108527131782946
[2024-06-14 16:12:11,222 INFO  L175             Difference]: Start difference. First operand has 89 places, 90 transitions, 623 flow. Second operand 6 states and 106 transitions.
[2024-06-14 16:12:11,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 908 flow
[2024-06-14 16:12:11,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 852 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-14 16:12:11,239 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 658 flow
[2024-06-14 16:12:11,239 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=90, PETRI_TRANSITIONS=96}
[2024-06-14 16:12:11,239 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places.
[2024-06-14 16:12:11,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 658 flow
[2024-06-14 16:12:11,240 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:12:11,240 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:11,240 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:11,240 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 16:12:11,241 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-14 16:12:11,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:11,241 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797136608, now seen corresponding path program 2 times
[2024-06-14 16:12:11,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:11,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940772475]
[2024-06-14 16:12:11,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:11,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:11,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:20,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:20,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:20,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940772475]
[2024-06-14 16:12:20,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940772475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:20,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:20,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:12:20,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203388097]
[2024-06-14 16:12:20,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:20,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:12:20,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:20,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:12:20,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:12:20,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:12:20,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 658 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:12:20,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:20,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:12:20,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:21,752 INFO  L124   PetriNetUnfolderBase]: 1643/2511 cut-off events.
[2024-06-14 16:12:21,752 INFO  L125   PetriNetUnfolderBase]: For 46964/46967 co-relation queries the response was YES.
[2024-06-14 16:12:21,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13667 conditions, 2511 events. 1643/2511 cut-off events. For 46964/46967 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12424 event pairs, 630 based on Foata normal form. 2/2509 useless extension candidates. Maximal degree in co-relation 13625. Up to 2405 conditions per place. 
[2024-06-14 16:12:21,765 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 88 selfloop transitions, 21 changer transitions 0/114 dead transitions.
[2024-06-14 16:12:21,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 114 transitions, 1020 flow
[2024-06-14 16:12:21,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:12:21,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:12:21,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 16:12:21,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41472868217054265
[2024-06-14 16:12:21,768 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 658 flow. Second operand 6 states and 107 transitions.
[2024-06-14 16:12:21,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 114 transitions, 1020 flow
[2024-06-14 16:12:21,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 114 transitions, 984 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-14 16:12:21,787 INFO  L231             Difference]: Finished difference. Result has 94 places, 102 transitions, 748 flow
[2024-06-14 16:12:21,787 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=94, PETRI_TRANSITIONS=102}
[2024-06-14 16:12:21,787 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places.
[2024-06-14 16:12:21,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 748 flow
[2024-06-14 16:12:21,788 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-14 16:12:21,788 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:21,788 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:21,788 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 16:12:21,788 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:21,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:21,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797127680, now seen corresponding path program 1 times
[2024-06-14 16:12:21,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:21,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481944572]
[2024-06-14 16:12:21,789 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:21,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:21,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:32,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:32,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:32,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481944572]
[2024-06-14 16:12:32,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481944572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:32,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:32,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:12:32,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994234291]
[2024-06-14 16:12:32,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:32,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:12:32,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:32,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:12:32,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:12:32,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:12:32,430 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 748 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:32,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:32,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:12:32,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:33,547 INFO  L124   PetriNetUnfolderBase]: 1689/2587 cut-off events.
[2024-06-14 16:12:33,548 INFO  L125   PetriNetUnfolderBase]: For 52414/52417 co-relation queries the response was YES.
[2024-06-14 16:12:33,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14459 conditions, 2587 events. 1689/2587 cut-off events. For 52414/52417 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12843 event pairs, 597 based on Foata normal form. 6/2589 useless extension candidates. Maximal degree in co-relation 14415. Up to 2289 conditions per place. 
[2024-06-14 16:12:33,564 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 88 selfloop transitions, 45 changer transitions 0/138 dead transitions.
[2024-06-14 16:12:33,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 138 transitions, 1302 flow
[2024-06-14 16:12:33,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:12:33,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:12:33,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-14 16:12:33,566 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4331395348837209
[2024-06-14 16:12:33,566 INFO  L175             Difference]: Start difference. First operand has 94 places, 102 transitions, 748 flow. Second operand 8 states and 149 transitions.
[2024-06-14 16:12:33,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 138 transitions, 1302 flow
[2024-06-14 16:12:33,593 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 138 transitions, 1258 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-14 16:12:33,594 INFO  L231             Difference]: Finished difference. Result has 101 places, 115 transitions, 983 flow
[2024-06-14 16:12:33,595 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=983, PETRI_PLACES=101, PETRI_TRANSITIONS=115}
[2024-06-14 16:12:33,595 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places.
[2024-06-14 16:12:33,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 983 flow
[2024-06-14 16:12:33,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:33,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:33,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:33,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 16:12:33,596 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:33,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:33,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1789013292, now seen corresponding path program 1 times
[2024-06-14 16:12:33,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:33,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738041628]
[2024-06-14 16:12:33,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:33,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:33,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:44,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:44,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:44,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738041628]
[2024-06-14 16:12:44,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738041628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:44,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:44,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:12:44,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727549285]
[2024-06-14 16:12:44,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:44,288 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:12:44,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:44,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:12:44,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:12:44,499 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:12:44,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 983 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:44,500 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:44,500 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:12:44,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:45,892 INFO  L124   PetriNetUnfolderBase]: 1773/2708 cut-off events.
[2024-06-14 16:12:45,892 INFO  L125   PetriNetUnfolderBase]: For 62359/62359 co-relation queries the response was YES.
[2024-06-14 16:12:45,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16345 conditions, 2708 events. 1773/2708 cut-off events. For 62359/62359 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13542 event pairs, 462 based on Foata normal form. 8/2713 useless extension candidates. Maximal degree in co-relation 16298. Up to 2453 conditions per place. 
[2024-06-14 16:12:45,908 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 134 selfloop transitions, 20 changer transitions 0/159 dead transitions.
[2024-06-14 16:12:45,909 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 159 transitions, 1549 flow
[2024-06-14 16:12:45,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:12:45,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:12:45,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-14 16:12:45,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43410852713178294
[2024-06-14 16:12:45,911 INFO  L175             Difference]: Start difference. First operand has 101 places, 115 transitions, 983 flow. Second operand 9 states and 168 transitions.
[2024-06-14 16:12:45,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 159 transitions, 1549 flow
[2024-06-14 16:12:45,946 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 159 transitions, 1458 flow, removed 35 selfloop flow, removed 3 redundant places.
[2024-06-14 16:12:45,948 INFO  L231             Difference]: Finished difference. Result has 107 places, 119 transitions, 1023 flow
[2024-06-14 16:12:45,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1023, PETRI_PLACES=107, PETRI_TRANSITIONS=119}
[2024-06-14 16:12:45,949 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places.
[2024-06-14 16:12:45,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 119 transitions, 1023 flow
[2024-06-14 16:12:45,950 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:45,950 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:45,950 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:45,950 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 16:12:45,950 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:45,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:45,950 INFO  L85        PathProgramCache]: Analyzing trace with hash -1788895182, now seen corresponding path program 2 times
[2024-06-14 16:12:45,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:45,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77656683]
[2024-06-14 16:12:45,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:45,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:45,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:55,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:55,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:55,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77656683]
[2024-06-14 16:12:55,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77656683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:55,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:55,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:12:55,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129604890]
[2024-06-14 16:12:55,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:55,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:12:55,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:55,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:12:55,679 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:12:55,860 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:12:55,861 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 119 transitions, 1023 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:55,861 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:55,861 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:12:55,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:57,183 INFO  L124   PetriNetUnfolderBase]: 1757/2689 cut-off events.
[2024-06-14 16:12:57,184 INFO  L125   PetriNetUnfolderBase]: For 64114/64114 co-relation queries the response was YES.
[2024-06-14 16:12:57,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16217 conditions, 2689 events. 1757/2689 cut-off events. For 64114/64114 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13401 event pairs, 594 based on Foata normal form. 8/2694 useless extension candidates. Maximal degree in co-relation 16168. Up to 2521 conditions per place. 
[2024-06-14 16:12:57,200 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 130 selfloop transitions, 16 changer transitions 0/151 dead transitions.
[2024-06-14 16:12:57,200 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 151 transitions, 1399 flow
[2024-06-14 16:12:57,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:12:57,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:12:57,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-14 16:12:57,203 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-14 16:12:57,203 INFO  L175             Difference]: Start difference. First operand has 107 places, 119 transitions, 1023 flow. Second operand 8 states and 148 transitions.
[2024-06-14 16:12:57,203 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 151 transitions, 1399 flow
[2024-06-14 16:12:57,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 151 transitions, 1311 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-14 16:12:57,242 INFO  L231             Difference]: Finished difference. Result has 110 places, 119 transitions, 974 flow
[2024-06-14 16:12:57,243 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=974, PETRI_PLACES=110, PETRI_TRANSITIONS=119}
[2024-06-14 16:12:57,243 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places.
[2024-06-14 16:12:57,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 119 transitions, 974 flow
[2024-06-14 16:12:57,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:57,243 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:57,243 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:57,244 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 16:12:57,244 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:57,244 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:57,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -2122823362, now seen corresponding path program 1 times
[2024-06-14 16:12:57,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:57,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441956189]
[2024-06-14 16:12:57,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:57,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:57,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:07,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:07,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:07,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441956189]
[2024-06-14 16:13:07,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441956189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:07,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:07,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:13:07,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673977491]
[2024-06-14 16:13:07,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:07,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:13:07,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:07,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:13:07,747 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:13:07,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:13:07,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 119 transitions, 974 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-14 16:13:07,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:07,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:13:07,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:09,236 INFO  L124   PetriNetUnfolderBase]: 1779/2726 cut-off events.
[2024-06-14 16:13:09,236 INFO  L125   PetriNetUnfolderBase]: For 68142/68142 co-relation queries the response was YES.
[2024-06-14 16:13:09,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16358 conditions, 2726 events. 1779/2726 cut-off events. For 68142/68142 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13622 event pairs, 539 based on Foata normal form. 4/2727 useless extension candidates. Maximal degree in co-relation 16307. Up to 2545 conditions per place. 
[2024-06-14 16:13:09,254 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 119 selfloop transitions, 22 changer transitions 0/146 dead transitions.
[2024-06-14 16:13:09,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 146 transitions, 1358 flow
[2024-06-14 16:13:09,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:13:09,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:13:09,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-14 16:13:09,257 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43853820598006643
[2024-06-14 16:13:09,257 INFO  L175             Difference]: Start difference. First operand has 110 places, 119 transitions, 974 flow. Second operand 7 states and 132 transitions.
[2024-06-14 16:13:09,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 146 transitions, 1358 flow
[2024-06-14 16:13:09,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 1321 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-14 16:13:09,300 INFO  L231             Difference]: Finished difference. Result has 110 places, 122 transitions, 1039 flow
[2024-06-14 16:13:09,301 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=110, PETRI_TRANSITIONS=122}
[2024-06-14 16:13:09,305 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places.
[2024-06-14 16:13:09,305 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 122 transitions, 1039 flow
[2024-06-14 16:13:09,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-14 16:13:09,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:09,306 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:09,306 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 16:13:09,306 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:09,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:09,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007537152, now seen corresponding path program 3 times
[2024-06-14 16:13:09,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:09,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625162576]
[2024-06-14 16:13:09,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:09,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:09,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:19,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:19,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:19,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625162576]
[2024-06-14 16:13:19,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625162576] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:19,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:19,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:19,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959790493]
[2024-06-14 16:13:19,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:19,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:19,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:19,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:19,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:19,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:13:19,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 122 transitions, 1039 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:19,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:19,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:13:19,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:20,623 INFO  L124   PetriNetUnfolderBase]: 1813/2781 cut-off events.
[2024-06-14 16:13:20,623 INFO  L125   PetriNetUnfolderBase]: For 74517/74520 co-relation queries the response was YES.
[2024-06-14 16:13:20,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17213 conditions, 2781 events. 1813/2781 cut-off events. For 74517/74520 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13864 event pairs, 533 based on Foata normal form. 8/2785 useless extension candidates. Maximal degree in co-relation 17161. Up to 2502 conditions per place. 
[2024-06-14 16:13:20,639 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 32 changer transitions 0/168 dead transitions.
[2024-06-14 16:13:20,639 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 1531 flow
[2024-06-14 16:13:20,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:13:20,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:13:20,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 16:13:20,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4372093023255814
[2024-06-14 16:13:20,642 INFO  L175             Difference]: Start difference. First operand has 110 places, 122 transitions, 1039 flow. Second operand 10 states and 188 transitions.
[2024-06-14 16:13:20,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 168 transitions, 1531 flow
[2024-06-14 16:13:20,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 168 transitions, 1457 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-14 16:13:20,686 INFO  L231             Difference]: Finished difference. Result has 114 places, 124 transitions, 1086 flow
[2024-06-14 16:13:20,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1086, PETRI_PLACES=114, PETRI_TRANSITIONS=124}
[2024-06-14 16:13:20,687 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places.
[2024-06-14 16:13:20,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 124 transitions, 1086 flow
[2024-06-14 16:13:20,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:20,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:20,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:20,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 16:13:20,687 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:20,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:20,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835463968, now seen corresponding path program 2 times
[2024-06-14 16:13:20,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:20,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343031954]
[2024-06-14 16:13:20,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:20,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:20,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:30,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:30,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:30,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343031954]
[2024-06-14 16:13:30,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343031954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:30,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:30,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:30,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34816706]
[2024-06-14 16:13:30,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:30,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:30,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:30,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:30,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:30,973 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:13:30,974 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 124 transitions, 1086 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:13:30,974 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:30,974 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:13:30,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:32,283 INFO  L124   PetriNetUnfolderBase]: 1867/2879 cut-off events.
[2024-06-14 16:13:32,283 INFO  L125   PetriNetUnfolderBase]: For 77069/77072 co-relation queries the response was YES.
[2024-06-14 16:13:32,290 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17875 conditions, 2879 events. 1867/2879 cut-off events. For 77069/77072 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14673 event pairs, 481 based on Foata normal form. 4/2879 useless extension candidates. Maximal degree in co-relation 17823. Up to 2440 conditions per place. 
[2024-06-14 16:13:32,298 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 124 selfloop transitions, 46 changer transitions 0/175 dead transitions.
[2024-06-14 16:13:32,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 175 transitions, 1848 flow
[2024-06-14 16:13:32,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:13:32,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:13:32,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 16:13:32,301 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625322997416021
[2024-06-14 16:13:32,301 INFO  L175             Difference]: Start difference. First operand has 114 places, 124 transitions, 1086 flow. Second operand 9 states and 179 transitions.
[2024-06-14 16:13:32,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 175 transitions, 1848 flow
[2024-06-14 16:13:32,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 175 transitions, 1745 flow, removed 21 selfloop flow, removed 8 redundant places.
[2024-06-14 16:13:32,343 INFO  L231             Difference]: Finished difference. Result has 115 places, 133 transitions, 1233 flow
[2024-06-14 16:13:32,343 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1233, PETRI_PLACES=115, PETRI_TRANSITIONS=133}
[2024-06-14 16:13:32,344 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 71 predicate places.
[2024-06-14 16:13:32,344 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 133 transitions, 1233 flow
[2024-06-14 16:13:32,344 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:13:32,344 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:32,344 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:32,344 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 16:13:32,345 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-14 16:13:32,345 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:32,345 INFO  L85        PathProgramCache]: Analyzing trace with hash -687569584, now seen corresponding path program 3 times
[2024-06-14 16:13:32,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:32,345 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516536364]
[2024-06-14 16:13:32,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:32,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:32,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:41,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:41,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:41,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516536364]
[2024-06-14 16:13:41,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516536364] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:41,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:41,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:41,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046951530]
[2024-06-14 16:13:41,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:41,911 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:41,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:41,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:41,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:42,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:13:42,110 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 133 transitions, 1233 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:13:42,110 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:42,110 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:13:42,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:43,406 INFO  L124   PetriNetUnfolderBase]: 1857/2865 cut-off events.
[2024-06-14 16:13:43,407 INFO  L125   PetriNetUnfolderBase]: For 81516/81519 co-relation queries the response was YES.
[2024-06-14 16:13:43,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18104 conditions, 2865 events. 1857/2865 cut-off events. For 81516/81519 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14577 event pairs, 494 based on Foata normal form. 4/2865 useless extension candidates. Maximal degree in co-relation 18051. Up to 2432 conditions per place. 
[2024-06-14 16:13:43,425 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 116 selfloop transitions, 46 changer transitions 0/167 dead transitions.
[2024-06-14 16:13:43,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 167 transitions, 1733 flow
[2024-06-14 16:13:43,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:13:43,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:13:43,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 16:13:43,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4622093023255814
[2024-06-14 16:13:43,428 INFO  L175             Difference]: Start difference. First operand has 115 places, 133 transitions, 1233 flow. Second operand 8 states and 159 transitions.
[2024-06-14 16:13:43,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 167 transitions, 1733 flow
[2024-06-14 16:13:43,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 167 transitions, 1627 flow, removed 40 selfloop flow, removed 4 redundant places.
[2024-06-14 16:13:43,482 INFO  L231             Difference]: Finished difference. Result has 119 places, 133 transitions, 1227 flow
[2024-06-14 16:13:43,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1227, PETRI_PLACES=119, PETRI_TRANSITIONS=133}
[2024-06-14 16:13:43,483 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places.
[2024-06-14 16:13:43,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 133 transitions, 1227 flow
[2024-06-14 16:13:43,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:13:43,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:43,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:43,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 16:13:43,484 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:43,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:43,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835217890, now seen corresponding path program 1 times
[2024-06-14 16:13:43,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:43,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552720792]
[2024-06-14 16:13:43,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:43,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:43,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:53,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:53,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:53,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552720792]
[2024-06-14 16:13:53,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552720792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:53,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:53,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:53,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772352074]
[2024-06-14 16:13:53,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:53,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:53,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:53,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:53,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:53,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:13:53,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 133 transitions, 1227 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:53,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:53,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:13:53,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:55,254 INFO  L124   PetriNetUnfolderBase]: 1874/2882 cut-off events.
[2024-06-14 16:13:55,254 INFO  L125   PetriNetUnfolderBase]: For 86878/86881 co-relation queries the response was YES.
[2024-06-14 16:13:55,262 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18518 conditions, 2882 events. 1874/2882 cut-off events. For 86878/86881 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14599 event pairs, 527 based on Foata normal form. 4/2882 useless extension candidates. Maximal degree in co-relation 18463. Up to 2623 conditions per place. 
[2024-06-14 16:13:55,271 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 132 selfloop transitions, 30 changer transitions 0/167 dead transitions.
[2024-06-14 16:13:55,272 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 167 transitions, 1677 flow
[2024-06-14 16:13:55,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:13:55,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:13:55,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 16:13:55,274 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44476744186046513
[2024-06-14 16:13:55,274 INFO  L175             Difference]: Start difference. First operand has 119 places, 133 transitions, 1227 flow. Second operand 8 states and 153 transitions.
[2024-06-14 16:13:55,274 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 167 transitions, 1677 flow
[2024-06-14 16:13:55,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 167 transitions, 1577 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 16:13:55,316 INFO  L231             Difference]: Finished difference. Result has 120 places, 135 transitions, 1242 flow
[2024-06-14 16:13:55,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1242, PETRI_PLACES=120, PETRI_TRANSITIONS=135}
[2024-06-14 16:13:55,317 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places.
[2024-06-14 16:13:55,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1242 flow
[2024-06-14 16:13:55,318 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:55,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:55,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:55,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 16:13:55,318 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:55,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:55,319 INFO  L85        PathProgramCache]: Analyzing trace with hash -1128776622, now seen corresponding path program 4 times
[2024-06-14 16:13:55,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:55,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950703358]
[2024-06-14 16:13:55,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:55,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:55,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:04,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:04,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:04,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950703358]
[2024-06-14 16:14:04,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950703358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:04,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:04,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:14:04,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857740730]
[2024-06-14 16:14:04,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:04,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:14:04,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:04,474 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:14:04,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:14:04,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:14:04,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 135 transitions, 1242 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:04,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:04,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:14:04,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:05,873 INFO  L124   PetriNetUnfolderBase]: 1858/2847 cut-off events.
[2024-06-14 16:14:05,874 INFO  L125   PetriNetUnfolderBase]: For 91142/91142 co-relation queries the response was YES.
[2024-06-14 16:14:05,881 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18417 conditions, 2847 events. 1858/2847 cut-off events. For 91142/91142 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14363 event pairs, 529 based on Foata normal form. 8/2852 useless extension candidates. Maximal degree in co-relation 18361. Up to 2569 conditions per place. 
[2024-06-14 16:14:05,891 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 140 selfloop transitions, 31 changer transitions 0/176 dead transitions.
[2024-06-14 16:14:05,892 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 176 transitions, 1742 flow
[2024-06-14 16:14:05,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:14:05,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:14:05,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-14 16:14:05,894 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4232558139534884
[2024-06-14 16:14:05,894 INFO  L175             Difference]: Start difference. First operand has 120 places, 135 transitions, 1242 flow. Second operand 10 states and 182 transitions.
[2024-06-14 16:14:05,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 176 transitions, 1742 flow
[2024-06-14 16:14:05,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 176 transitions, 1645 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-14 16:14:05,940 INFO  L231             Difference]: Finished difference. Result has 124 places, 137 transitions, 1272 flow
[2024-06-14 16:14:05,940 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1272, PETRI_PLACES=124, PETRI_TRANSITIONS=137}
[2024-06-14 16:14:05,941 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places.
[2024-06-14 16:14:05,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 137 transitions, 1272 flow
[2024-06-14 16:14:05,941 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:05,941 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:05,942 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:05,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 16:14:05,942 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:05,942 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:05,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 398270356, now seen corresponding path program 4 times
[2024-06-14 16:14:05,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:05,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862544773]
[2024-06-14 16:14:05,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:05,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:06,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:15,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:15,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:15,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862544773]
[2024-06-14 16:14:15,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862544773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:15,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:15,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:14:15,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881224208]
[2024-06-14 16:14:15,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:15,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:14:15,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:15,746 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:14:15,746 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:14:15,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 16:14:15,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 137 transitions, 1272 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-14 16:14:15,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:15,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 16:14:15,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:17,112 INFO  L124   PetriNetUnfolderBase]: 1880/2894 cut-off events.
[2024-06-14 16:14:17,113 INFO  L125   PetriNetUnfolderBase]: For 97112/97112 co-relation queries the response was YES.
[2024-06-14 16:14:17,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18839 conditions, 2894 events. 1880/2894 cut-off events. For 97112/97112 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14737 event pairs, 474 based on Foata normal form. 4/2892 useless extension candidates. Maximal degree in co-relation 18782. Up to 2454 conditions per place. 
[2024-06-14 16:14:17,135 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 128 selfloop transitions, 52 changer transitions 0/185 dead transitions.
[2024-06-14 16:14:17,135 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 185 transitions, 1904 flow
[2024-06-14 16:14:17,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:14:17,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:14:17,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-14 16:14:17,137 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4697674418604651
[2024-06-14 16:14:17,138 INFO  L175             Difference]: Start difference. First operand has 124 places, 137 transitions, 1272 flow. Second operand 10 states and 202 transitions.
[2024-06-14 16:14:17,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 185 transitions, 1904 flow
[2024-06-14 16:14:17,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 1795 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-14 16:14:17,195 INFO  L231             Difference]: Finished difference. Result has 126 places, 140 transitions, 1329 flow
[2024-06-14 16:14:17,195 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=126, PETRI_TRANSITIONS=140}
[2024-06-14 16:14:17,196 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places.
[2024-06-14 16:14:17,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 140 transitions, 1329 flow
[2024-06-14 16:14:17,196 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-14 16:14:17,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:17,196 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:17,196 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 16:14:17,196 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:17,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:17,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 398507506, now seen corresponding path program 5 times
[2024-06-14 16:14:17,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:17,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228859000]
[2024-06-14 16:14:17,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:17,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:17,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:28,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:28,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:28,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228859000]
[2024-06-14 16:14:28,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228859000] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:28,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:28,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:14:28,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908077364]
[2024-06-14 16:14:28,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:28,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:14:28,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:28,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:14:28,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:14:28,580 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:14:28,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 140 transitions, 1329 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:14:28,581 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:28,581 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:14:28,581 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:29,970 INFO  L124   PetriNetUnfolderBase]: 1902/2936 cut-off events.
[2024-06-14 16:14:29,971 INFO  L125   PetriNetUnfolderBase]: For 102238/102238 co-relation queries the response was YES.
[2024-06-14 16:14:29,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19223 conditions, 2936 events. 1902/2936 cut-off events. For 102238/102238 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15031 event pairs, 477 based on Foata normal form. 4/2937 useless extension candidates. Maximal degree in co-relation 19165. Up to 2473 conditions per place. 
[2024-06-14 16:14:29,989 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 129 selfloop transitions, 52 changer transitions 0/186 dead transitions.
[2024-06-14 16:14:29,990 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 1965 flow
[2024-06-14 16:14:29,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:14:29,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:14:29,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-14 16:14:29,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44651162790697674
[2024-06-14 16:14:29,993 INFO  L175             Difference]: Start difference. First operand has 126 places, 140 transitions, 1329 flow. Second operand 10 states and 192 transitions.
[2024-06-14 16:14:29,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 1965 flow
[2024-06-14 16:14:30,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 186 transitions, 1800 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-14 16:14:30,044 INFO  L231             Difference]: Finished difference. Result has 129 places, 143 transitions, 1336 flow
[2024-06-14 16:14:30,044 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1336, PETRI_PLACES=129, PETRI_TRANSITIONS=143}
[2024-06-14 16:14:30,044 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places.
[2024-06-14 16:14:30,045 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 143 transitions, 1336 flow
[2024-06-14 16:14:30,045 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:14:30,045 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:30,045 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:30,045 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 16:14:30,046 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:30,046 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:30,046 INFO  L85        PathProgramCache]: Analyzing trace with hash 683607376, now seen corresponding path program 6 times
[2024-06-14 16:14:30,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:30,046 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120646055]
[2024-06-14 16:14:30,046 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:30,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:30,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:40,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:40,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:40,187 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120646055]
[2024-06-14 16:14:40,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120646055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:40,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:40,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:14:40,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099997228]
[2024-06-14 16:14:40,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:40,188 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:14:40,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:40,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:14:40,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:14:40,415 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:14:40,415 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 143 transitions, 1336 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:14:40,415 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:40,415 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:14:40,415 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:41,832 INFO  L124   PetriNetUnfolderBase]: 1892/2922 cut-off events.
[2024-06-14 16:14:41,833 INFO  L125   PetriNetUnfolderBase]: For 105719/105719 co-relation queries the response was YES.
[2024-06-14 16:14:41,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19081 conditions, 2922 events. 1892/2922 cut-off events. For 105719/105719 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14942 event pairs, 482 based on Foata normal form. 4/2923 useless extension candidates. Maximal degree in co-relation 19022. Up to 2465 conditions per place. 
[2024-06-14 16:14:41,853 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 125 selfloop transitions, 56 changer transitions 0/186 dead transitions.
[2024-06-14 16:14:41,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 186 transitions, 1806 flow
[2024-06-14 16:14:41,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:14:41,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:14:41,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions.
[2024-06-14 16:14:41,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42283298097251587
[2024-06-14 16:14:41,856 INFO  L175             Difference]: Start difference. First operand has 129 places, 143 transitions, 1336 flow. Second operand 11 states and 200 transitions.
[2024-06-14 16:14:41,856 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 186 transitions, 1806 flow
[2024-06-14 16:14:41,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 186 transitions, 1655 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-14 16:14:41,914 INFO  L231             Difference]: Finished difference. Result has 133 places, 143 transitions, 1305 flow
[2024-06-14 16:14:41,914 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1305, PETRI_PLACES=133, PETRI_TRANSITIONS=143}
[2024-06-14 16:14:41,914 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-14 16:14:41,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 143 transitions, 1305 flow
[2024-06-14 16:14:41,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 16:14:41,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:41,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:41,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 16:14:41,915 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:41,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:41,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 398516434, now seen corresponding path program 2 times
[2024-06-14 16:14:41,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:41,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235556833]
[2024-06-14 16:14:41,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:41,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:41,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:55,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:55,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:55,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235556833]
[2024-06-14 16:14:55,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235556833] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:55,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:55,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:14:55,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445773455]
[2024-06-14 16:14:55,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:55,553 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:14:55,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:55,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:14:55,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:14:55,727 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:14:55,727 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 143 transitions, 1305 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:55,728 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:55,728 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:14:55,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:57,146 INFO  L124   PetriNetUnfolderBase]: 1909/2954 cut-off events.
[2024-06-14 16:14:57,147 INFO  L125   PetriNetUnfolderBase]: For 111443/111443 co-relation queries the response was YES.
[2024-06-14 16:14:57,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19363 conditions, 2954 events. 1909/2954 cut-off events. For 111443/111443 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15149 event pairs, 507 based on Foata normal form. 4/2955 useless extension candidates. Maximal degree in co-relation 19303. Up to 2676 conditions per place. 
[2024-06-14 16:14:57,165 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 148 selfloop transitions, 32 changer transitions 0/185 dead transitions.
[2024-06-14 16:14:57,166 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 185 transitions, 1817 flow
[2024-06-14 16:14:57,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:14:57,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:14:57,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-14 16:14:57,168 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42790697674418604
[2024-06-14 16:14:57,168 INFO  L175             Difference]: Start difference. First operand has 133 places, 143 transitions, 1305 flow. Second operand 10 states and 184 transitions.
[2024-06-14 16:14:57,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 185 transitions, 1817 flow
[2024-06-14 16:14:57,230 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 185 transitions, 1680 flow, removed 2 selfloop flow, removed 11 redundant places.
[2024-06-14 16:14:57,232 INFO  L231             Difference]: Finished difference. Result has 132 places, 145 transitions, 1293 flow
[2024-06-14 16:14:57,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1293, PETRI_PLACES=132, PETRI_TRANSITIONS=145}
[2024-06-14 16:14:57,232 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places.
[2024-06-14 16:14:57,233 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 145 transitions, 1293 flow
[2024-06-14 16:14:57,233 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:57,233 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:57,233 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:57,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 16:14:57,233 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:57,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:57,234 INFO  L85        PathProgramCache]: Analyzing trace with hash 693735634, now seen corresponding path program 3 times
[2024-06-14 16:14:57,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:57,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077455799]
[2024-06-14 16:14:57,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:57,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:57,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:08,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:08,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:08,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077455799]
[2024-06-14 16:15:08,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077455799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:08,645 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:08,645 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:08,645 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245061794]
[2024-06-14 16:15:08,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:08,646 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:08,646 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:08,646 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:08,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:08,819 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:15:08,821 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 145 transitions, 1293 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:08,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:08,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:15:08,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:10,134 INFO  L124   PetriNetUnfolderBase]: 1926/2986 cut-off events.
[2024-06-14 16:15:10,134 INFO  L125   PetriNetUnfolderBase]: For 118957/118957 co-relation queries the response was YES.
[2024-06-14 16:15:10,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19732 conditions, 2986 events. 1926/2986 cut-off events. For 118957/118957 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15344 event pairs, 512 based on Foata normal form. 4/2987 useless extension candidates. Maximal degree in co-relation 19671. Up to 2703 conditions per place. 
[2024-06-14 16:15:10,154 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 147 selfloop transitions, 33 changer transitions 0/185 dead transitions.
[2024-06-14 16:15:10,154 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 185 transitions, 1803 flow
[2024-06-14 16:15:10,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:15:10,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:15:10,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-14 16:15:10,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186046511627907
[2024-06-14 16:15:10,159 INFO  L175             Difference]: Start difference. First operand has 132 places, 145 transitions, 1293 flow. Second operand 10 states and 180 transitions.
[2024-06-14 16:15:10,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 185 transitions, 1803 flow
[2024-06-14 16:15:10,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 185 transitions, 1696 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-14 16:15:10,223 INFO  L231             Difference]: Finished difference. Result has 134 places, 147 transitions, 1317 flow
[2024-06-14 16:15:10,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1317, PETRI_PLACES=134, PETRI_TRANSITIONS=147}
[2024-06-14 16:15:10,223 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places.
[2024-06-14 16:15:10,223 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 147 transitions, 1317 flow
[2024-06-14 16:15:10,223 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:10,224 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:10,226 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:10,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 16:15:10,226 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:10,226 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:10,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 694091824, now seen corresponding path program 4 times
[2024-06-14 16:15:10,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:10,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985291660]
[2024-06-14 16:15:10,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:10,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:10,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:21,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:21,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:21,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985291660]
[2024-06-14 16:15:21,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985291660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:21,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:21,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:21,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659090004]
[2024-06-14 16:15:21,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:21,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:21,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:21,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:21,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:21,690 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:15:21,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 147 transitions, 1317 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:21,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:21,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:15:21,691 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:22,952 INFO  L124   PetriNetUnfolderBase]: 1918/2974 cut-off events.
[2024-06-14 16:15:22,952 INFO  L125   PetriNetUnfolderBase]: For 123693/123693 co-relation queries the response was YES.
[2024-06-14 16:15:22,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19745 conditions, 2974 events. 1918/2974 cut-off events. For 123693/123693 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15409 event pairs, 487 based on Foata normal form. 4/2972 useless extension candidates. Maximal degree in co-relation 19683. Up to 2614 conditions per place. 
[2024-06-14 16:15:22,972 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 134 selfloop transitions, 37 changer transitions 0/176 dead transitions.
[2024-06-14 16:15:22,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 176 transitions, 1785 flow
[2024-06-14 16:15:22,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:15:22,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:15:22,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 16:15:22,973 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42441860465116277
[2024-06-14 16:15:22,973 INFO  L175             Difference]: Start difference. First operand has 134 places, 147 transitions, 1317 flow. Second operand 8 states and 146 transitions.
[2024-06-14 16:15:22,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 176 transitions, 1785 flow
[2024-06-14 16:15:23,036 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 176 transitions, 1672 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-14 16:15:23,038 INFO  L231             Difference]: Finished difference. Result has 134 places, 149 transitions, 1347 flow
[2024-06-14 16:15:23,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1347, PETRI_PLACES=134, PETRI_TRANSITIONS=149}
[2024-06-14 16:15:23,038 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places.
[2024-06-14 16:15:23,038 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 149 transitions, 1347 flow
[2024-06-14 16:15:23,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:23,039 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:23,039 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:23,039 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 16:15:23,039 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:23,039 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:23,039 INFO  L85        PathProgramCache]: Analyzing trace with hash -83461581, now seen corresponding path program 1 times
[2024-06-14 16:15:23,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:23,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316151612]
[2024-06-14 16:15:23,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:23,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:23,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:32,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:32,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:32,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316151612]
[2024-06-14 16:15:32,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316151612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:32,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:32,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:15:32,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727569364]
[2024-06-14 16:15:32,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:32,763 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:15:32,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:32,764 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:15:32,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:15:32,903 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:15:32,903 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 149 transitions, 1347 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:32,903 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:32,903 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:15:32,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:33,961 INFO  L124   PetriNetUnfolderBase]: 1915/2965 cut-off events.
[2024-06-14 16:15:33,961 INFO  L125   PetriNetUnfolderBase]: For 128084/128084 co-relation queries the response was YES.
[2024-06-14 16:15:33,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19891 conditions, 2965 events. 1915/2965 cut-off events. For 128084/128084 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15183 event pairs, 589 based on Foata normal form. 1/2963 useless extension candidates. Maximal degree in co-relation 19828. Up to 2829 conditions per place. 
[2024-06-14 16:15:33,980 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 141 selfloop transitions, 16 changer transitions 0/162 dead transitions.
[2024-06-14 16:15:33,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 162 transitions, 1695 flow
[2024-06-14 16:15:33,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:15:33,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:15:33,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 16:15:33,989 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4108527131782946
[2024-06-14 16:15:33,990 INFO  L175             Difference]: Start difference. First operand has 134 places, 149 transitions, 1347 flow. Second operand 6 states and 106 transitions.
[2024-06-14 16:15:33,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 162 transitions, 1695 flow
[2024-06-14 16:15:34,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 162 transitions, 1556 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-14 16:15:34,058 INFO  L231             Difference]: Finished difference. Result has 134 places, 149 transitions, 1250 flow
[2024-06-14 16:15:34,058 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1250, PETRI_PLACES=134, PETRI_TRANSITIONS=149}
[2024-06-14 16:15:34,059 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places.
[2024-06-14 16:15:34,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 149 transitions, 1250 flow
[2024-06-14 16:15:34,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:34,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:34,059 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:34,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 16:15:34,060 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:34,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:34,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -927764272, now seen corresponding path program 1 times
[2024-06-14 16:15:34,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:34,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850936063]
[2024-06-14 16:15:34,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:34,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:34,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:42,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:42,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:42,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850936063]
[2024-06-14 16:15:42,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850936063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:42,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:42,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:15:42,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810187210]
[2024-06-14 16:15:42,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:42,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:15:42,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:42,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:15:42,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:15:43,079 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:15:43,080 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 149 transitions, 1250 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:43,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:43,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:15:43,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:44,245 INFO  L124   PetriNetUnfolderBase]: 1971/3051 cut-off events.
[2024-06-14 16:15:44,246 INFO  L125   PetriNetUnfolderBase]: For 137381/137381 co-relation queries the response was YES.
[2024-06-14 16:15:44,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20320 conditions, 3051 events. 1971/3051 cut-off events. For 137381/137381 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15729 event pairs, 574 based on Foata normal form. 4/3051 useless extension candidates. Maximal degree in co-relation 20256. Up to 2809 conditions per place. 
[2024-06-14 16:15:44,266 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 149 selfloop transitions, 35 changer transitions 0/189 dead transitions.
[2024-06-14 16:15:44,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 189 transitions, 1889 flow
[2024-06-14 16:15:44,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:15:44,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:15:44,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:15:44,267 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4134366925064599
[2024-06-14 16:15:44,267 INFO  L175             Difference]: Start difference. First operand has 134 places, 149 transitions, 1250 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:15:44,267 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 189 transitions, 1889 flow
[2024-06-14 16:15:44,340 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 189 transitions, 1847 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-14 16:15:44,342 INFO  L231             Difference]: Finished difference. Result has 140 places, 162 transitions, 1450 flow
[2024-06-14 16:15:44,342 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1450, PETRI_PLACES=140, PETRI_TRANSITIONS=162}
[2024-06-14 16:15:44,343 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places.
[2024-06-14 16:15:44,343 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 162 transitions, 1450 flow
[2024-06-14 16:15:44,343 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:44,343 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:44,343 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:44,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 16:15:44,344 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-14 16:15:44,344 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:44,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 123608716, now seen corresponding path program 2 times
[2024-06-14 16:15:44,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:44,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763119523]
[2024-06-14 16:15:44,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:44,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:44,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:53,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:53,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:53,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763119523]
[2024-06-14 16:15:53,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763119523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:53,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:53,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:15:53,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229470189]
[2024-06-14 16:15:53,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:53,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:15:53,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:53,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:15:53,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:15:53,432 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:15:53,432 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 162 transitions, 1450 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:53,432 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:53,433 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:15:53,433 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:54,551 INFO  L124   PetriNetUnfolderBase]: 1995/3097 cut-off events.
[2024-06-14 16:15:54,551 INFO  L125   PetriNetUnfolderBase]: For 147093/147096 co-relation queries the response was YES.
[2024-06-14 16:15:54,559 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21050 conditions, 3097 events. 1995/3097 cut-off events. For 147093/147096 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15928 event pairs, 559 based on Foata normal form. 8/3101 useless extension candidates. Maximal degree in co-relation 20983. Up to 2640 conditions per place. 
[2024-06-14 16:15:54,569 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 128 selfloop transitions, 63 changer transitions 0/196 dead transitions.
[2024-06-14 16:15:54,569 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 196 transitions, 2224 flow
[2024-06-14 16:15:54,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:15:54,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:15:54,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 16:15:54,572 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-14 16:15:54,572 INFO  L175             Difference]: Start difference. First operand has 140 places, 162 transitions, 1450 flow. Second operand 8 states and 151 transitions.
[2024-06-14 16:15:54,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 196 transitions, 2224 flow
[2024-06-14 16:15:54,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 196 transitions, 2155 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-14 16:15:54,670 INFO  L231             Difference]: Finished difference. Result has 144 places, 173 transitions, 1693 flow
[2024-06-14 16:15:54,670 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1693, PETRI_PLACES=144, PETRI_TRANSITIONS=173}
[2024-06-14 16:15:54,671 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places.
[2024-06-14 16:15:54,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 173 transitions, 1693 flow
[2024-06-14 16:15:54,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:54,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:54,671 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:54,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 16:15:54,672 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:54,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:54,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 123341806, now seen corresponding path program 3 times
[2024-06-14 16:15:54,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:54,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140826212]
[2024-06-14 16:15:54,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:54,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:54,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:04,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:04,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:04,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140826212]
[2024-06-14 16:16:04,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140826212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:04,263 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:04,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:04,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210862838]
[2024-06-14 16:16:04,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:04,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:04,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:04,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:04,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:04,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:16:04,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 173 transitions, 1693 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:04,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:04,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:16:04,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:05,491 INFO  L124   PetriNetUnfolderBase]: 2033/3150 cut-off events.
[2024-06-14 16:16:05,491 INFO  L125   PetriNetUnfolderBase]: For 154347/154350 co-relation queries the response was YES.
[2024-06-14 16:16:05,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22147 conditions, 3150 events. 2033/3150 cut-off events. For 154347/154350 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16240 event pairs, 586 based on Foata normal form. 4/3150 useless extension candidates. Maximal degree in co-relation 22079. Up to 2674 conditions per place. 
[2024-06-14 16:16:05,516 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 137 selfloop transitions, 65 changer transitions 0/207 dead transitions.
[2024-06-14 16:16:05,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 207 transitions, 2497 flow
[2024-06-14 16:16:05,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:16:05,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:16:05,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 16:16:05,535 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.436046511627907
[2024-06-14 16:16:05,535 INFO  L175             Difference]: Start difference. First operand has 144 places, 173 transitions, 1693 flow. Second operand 8 states and 150 transitions.
[2024-06-14 16:16:05,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 207 transitions, 2497 flow
[2024-06-14 16:16:05,659 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 207 transitions, 2366 flow, removed 53 selfloop flow, removed 3 redundant places.
[2024-06-14 16:16:05,661 INFO  L231             Difference]: Finished difference. Result has 151 places, 185 transitions, 1952 flow
[2024-06-14 16:16:05,662 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1952, PETRI_PLACES=151, PETRI_TRANSITIONS=185}
[2024-06-14 16:16:05,671 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 107 predicate places.
[2024-06-14 16:16:05,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 185 transitions, 1952 flow
[2024-06-14 16:16:05,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:05,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:05,671 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:05,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 16:16:05,671 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:05,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:05,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 123618636, now seen corresponding path program 1 times
[2024-06-14 16:16:05,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:05,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250438029]
[2024-06-14 16:16:05,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:05,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:05,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:15,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:15,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:15,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250438029]
[2024-06-14 16:16:15,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250438029] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:15,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:15,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:16:15,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497715344]
[2024-06-14 16:16:15,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:15,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:16:15,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:15,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:16:15,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:16:15,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:16:15,443 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 185 transitions, 1952 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:15,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:15,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:16:15,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:16,562 INFO  L124   PetriNetUnfolderBase]: 2036/3150 cut-off events.
[2024-06-14 16:16:16,562 INFO  L125   PetriNetUnfolderBase]: For 161104/161104 co-relation queries the response was YES.
[2024-06-14 16:16:16,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22675 conditions, 3150 events. 2036/3150 cut-off events. For 161104/161104 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16174 event pairs, 583 based on Foata normal form. 4/3151 useless extension candidates. Maximal degree in co-relation 22603. Up to 2973 conditions per place. 
[2024-06-14 16:16:16,585 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 177 selfloop transitions, 28 changer transitions 0/210 dead transitions.
[2024-06-14 16:16:16,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 210 transitions, 2497 flow
[2024-06-14 16:16:16,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:16:16,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:16:16,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-14 16:16:16,596 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39018087855297157
[2024-06-14 16:16:16,596 INFO  L175             Difference]: Start difference. First operand has 151 places, 185 transitions, 1952 flow. Second operand 9 states and 151 transitions.
[2024-06-14 16:16:16,596 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 210 transitions, 2497 flow
[2024-06-14 16:16:16,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 210 transitions, 2377 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-14 16:16:16,726 INFO  L231             Difference]: Finished difference. Result has 157 places, 191 transitions, 2000 flow
[2024-06-14 16:16:16,726 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2000, PETRI_PLACES=157, PETRI_TRANSITIONS=191}
[2024-06-14 16:16:16,727 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 113 predicate places.
[2024-06-14 16:16:16,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 191 transitions, 2000 flow
[2024-06-14 16:16:16,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:16,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:16,727 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:16,727 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 16:16:16,728 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:16,728 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:16,728 INFO  L85        PathProgramCache]: Analyzing trace with hash -235572771, now seen corresponding path program 1 times
[2024-06-14 16:16:16,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:16,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075415796]
[2024-06-14 16:16:16,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:16,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:16,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:25,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:25,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:25,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075415796]
[2024-06-14 16:16:25,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075415796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:25,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:25,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:25,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979845696]
[2024-06-14 16:16:25,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:25,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:25,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:25,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:25,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:25,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:16:25,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 191 transitions, 2000 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:25,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:25,753 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:16:25,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:26,942 INFO  L124   PetriNetUnfolderBase]: 2041/3149 cut-off events.
[2024-06-14 16:16:26,943 INFO  L125   PetriNetUnfolderBase]: For 166566/166566 co-relation queries the response was YES.
[2024-06-14 16:16:26,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22841 conditions, 3149 events. 2041/3149 cut-off events. For 166566/166566 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16198 event pairs, 583 based on Foata normal form. 1/3147 useless extension candidates. Maximal degree in co-relation 22767. Up to 3000 conditions per place. 
[2024-06-14 16:16:26,963 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 197 selfloop transitions, 14 changer transitions 0/216 dead transitions.
[2024-06-14 16:16:26,964 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 216 transitions, 2520 flow
[2024-06-14 16:16:26,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:16:26,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:16:26,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 16:16:26,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186046511627907
[2024-06-14 16:16:26,965 INFO  L175             Difference]: Start difference. First operand has 157 places, 191 transitions, 2000 flow. Second operand 7 states and 126 transitions.
[2024-06-14 16:16:26,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 216 transitions, 2520 flow
[2024-06-14 16:16:27,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 216 transitions, 2417 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-14 16:16:27,080 INFO  L231             Difference]: Finished difference. Result has 158 places, 194 transitions, 1979 flow
[2024-06-14 16:16:27,080 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1979, PETRI_PLACES=158, PETRI_TRANSITIONS=194}
[2024-06-14 16:16:27,080 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places.
[2024-06-14 16:16:27,080 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 194 transitions, 1979 flow
[2024-06-14 16:16:27,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:27,081 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:27,081 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:27,081 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 16:16:27,081 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:27,081 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:27,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -405667937, now seen corresponding path program 2 times
[2024-06-14 16:16:27,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:27,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822041635]
[2024-06-14 16:16:27,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:27,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:27,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:36,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:36,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:36,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822041635]
[2024-06-14 16:16:36,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822041635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:36,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:36,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:36,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488659484]
[2024-06-14 16:16:36,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:36,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:36,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:36,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:36,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:36,949 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:16:36,949 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 194 transitions, 1979 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:36,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:36,950 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:16:36,950 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:38,011 INFO  L124   PetriNetUnfolderBase]: 2046/3164 cut-off events.
[2024-06-14 16:16:38,011 INFO  L125   PetriNetUnfolderBase]: For 173109/173109 co-relation queries the response was YES.
[2024-06-14 16:16:38,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23174 conditions, 3164 events. 2046/3164 cut-off events. For 173109/173109 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16314 event pairs, 585 based on Foata normal form. 1/3162 useless extension candidates. Maximal degree in co-relation 23099. Up to 3019 conditions per place. 
[2024-06-14 16:16:38,031 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 194 selfloop transitions, 14 changer transitions 0/213 dead transitions.
[2024-06-14 16:16:38,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 213 transitions, 2483 flow
[2024-06-14 16:16:38,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:16:38,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:16:38,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-14 16:16:38,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39867109634551495
[2024-06-14 16:16:38,033 INFO  L175             Difference]: Start difference. First operand has 158 places, 194 transitions, 1979 flow. Second operand 7 states and 120 transitions.
[2024-06-14 16:16:38,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 213 transitions, 2483 flow
[2024-06-14 16:16:38,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 213 transitions, 2423 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-14 16:16:38,143 INFO  L231             Difference]: Finished difference. Result has 160 places, 197 transitions, 2007 flow
[2024-06-14 16:16:38,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2007, PETRI_PLACES=160, PETRI_TRANSITIONS=197}
[2024-06-14 16:16:38,143 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places.
[2024-06-14 16:16:38,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 197 transitions, 2007 flow
[2024-06-14 16:16:38,144 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:38,144 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:38,144 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:38,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 16:16:38,144 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:38,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:38,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -412329217, now seen corresponding path program 1 times
[2024-06-14 16:16:38,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:38,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602826404]
[2024-06-14 16:16:38,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:38,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:38,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:46,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:46,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:46,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602826404]
[2024-06-14 16:16:46,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602826404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:46,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:46,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:46,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657896831]
[2024-06-14 16:16:46,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:46,883 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:46,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:46,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:46,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:46,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:16:46,974 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 197 transitions, 2007 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:46,974 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:46,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:16:46,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:48,141 INFO  L124   PetriNetUnfolderBase]: 2056/3179 cut-off events.
[2024-06-14 16:16:48,141 INFO  L125   PetriNetUnfolderBase]: For 181672/181675 co-relation queries the response was YES.
[2024-06-14 16:16:48,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23684 conditions, 3179 events. 2056/3179 cut-off events. For 181672/181675 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16434 event pairs, 590 based on Foata normal form. 2/3177 useless extension candidates. Maximal degree in co-relation 23608. Up to 2974 conditions per place. 
[2024-06-14 16:16:48,166 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 190 selfloop transitions, 26 changer transitions 0/221 dead transitions.
[2024-06-14 16:16:48,166 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 221 transitions, 2547 flow
[2024-06-14 16:16:48,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:16:48,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:16:48,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 16:16:48,168 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42524916943521596
[2024-06-14 16:16:48,168 INFO  L175             Difference]: Start difference. First operand has 160 places, 197 transitions, 2007 flow. Second operand 7 states and 128 transitions.
[2024-06-14 16:16:48,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 221 transitions, 2547 flow
[2024-06-14 16:16:48,297 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 221 transitions, 2481 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-14 16:16:48,299 INFO  L231             Difference]: Finished difference. Result has 163 places, 201 transitions, 2065 flow
[2024-06-14 16:16:48,300 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2065, PETRI_PLACES=163, PETRI_TRANSITIONS=201}
[2024-06-14 16:16:48,300 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places.
[2024-06-14 16:16:48,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 201 transitions, 2065 flow
[2024-06-14 16:16:48,300 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:48,300 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:48,300 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:48,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 16:16:48,301 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-14 16:16:48,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:48,301 INFO  L85        PathProgramCache]: Analyzing trace with hash -405662977, now seen corresponding path program 2 times
[2024-06-14 16:16:48,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:48,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079938874]
[2024-06-14 16:16:48,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:48,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:48,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:57,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-14 16:16:57,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:57,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079938874]
[2024-06-14 16:16:57,071 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079938874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:57,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:57,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:57,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482475715]
[2024-06-14 16:16:57,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:57,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:57,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:57,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:57,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:57,138 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:16:57,139 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 201 transitions, 2065 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:57,139 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:57,139 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:16:57,139 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:58,289 INFO  L124   PetriNetUnfolderBase]: 2090/3237 cut-off events.
[2024-06-14 16:16:58,289 INFO  L125   PetriNetUnfolderBase]: For 192625/192628 co-relation queries the response was YES.
[2024-06-14 16:16:58,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24447 conditions, 3237 events. 2090/3237 cut-off events. For 192625/192628 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16812 event pairs, 579 based on Foata normal form. 2/3235 useless extension candidates. Maximal degree in co-relation 24369. Up to 2997 conditions per place. 
[2024-06-14 16:16:58,313 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 188 selfloop transitions, 36 changer transitions 0/229 dead transitions.
[2024-06-14 16:16:58,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 229 transitions, 2806 flow
[2024-06-14 16:16:58,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:16:58,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:16:58,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 16:16:58,316 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42524916943521596
[2024-06-14 16:16:58,316 INFO  L175             Difference]: Start difference. First operand has 163 places, 201 transitions, 2065 flow. Second operand 7 states and 128 transitions.
[2024-06-14 16:16:58,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 229 transitions, 2806 flow
[2024-06-14 16:16:58,522 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 229 transitions, 2746 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 16:16:58,524 INFO  L231             Difference]: Finished difference. Result has 167 places, 210 transitions, 2271 flow
[2024-06-14 16:16:58,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2005, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2271, PETRI_PLACES=167, PETRI_TRANSITIONS=210}
[2024-06-14 16:16:58,525 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places.
[2024-06-14 16:16:58,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 210 transitions, 2271 flow
[2024-06-14 16:16:58,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:58,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:58,525 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:58,526 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 16:16:58,526 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-14 16:16:58,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:58,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -1223020963, now seen corresponding path program 3 times
[2024-06-14 16:16:58,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:58,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137734327]
[2024-06-14 16:16:58,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:58,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:58,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:08,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:08,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:08,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137734327]
[2024-06-14 16:17:08,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137734327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:08,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:08,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:17:08,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094969692]
[2024-06-14 16:17:08,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:08,172 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:17:08,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:08,173 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:17:08,173 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:17:08,299 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:17:08,299 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 210 transitions, 2271 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:08,299 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:08,299 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:17:08,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:09,468 INFO  L124   PetriNetUnfolderBase]: 2100/3249 cut-off events.
[2024-06-14 16:17:09,468 INFO  L125   PetriNetUnfolderBase]: For 201114/201114 co-relation queries the response was YES.
[2024-06-14 16:17:09,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24862 conditions, 3249 events. 2100/3249 cut-off events. For 201114/201114 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16812 event pairs, 584 based on Foata normal form. 2/3245 useless extension candidates. Maximal degree in co-relation 24782. Up to 3063 conditions per place. 
[2024-06-14 16:17:09,493 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 197 selfloop transitions, 26 changer transitions 0/228 dead transitions.
[2024-06-14 16:17:09,493 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 228 transitions, 2937 flow
[2024-06-14 16:17:09,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:17:09,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:17:09,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 16:17:09,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4019933554817276
[2024-06-14 16:17:09,495 INFO  L175             Difference]: Start difference. First operand has 167 places, 210 transitions, 2271 flow. Second operand 7 states and 121 transitions.
[2024-06-14 16:17:09,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 228 transitions, 2937 flow
[2024-06-14 16:17:09,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 228 transitions, 2860 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 16:17:09,638 INFO  L231             Difference]: Finished difference. Result has 170 places, 217 transitions, 2367 flow
[2024-06-14 16:17:09,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2367, PETRI_PLACES=170, PETRI_TRANSITIONS=217}
[2024-06-14 16:17:09,638 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 126 predicate places.
[2024-06-14 16:17:09,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 217 transitions, 2367 flow
[2024-06-14 16:17:09,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:09,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:09,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-14 16:17:09,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 16:17:09,639 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-14 16:17:09,639 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:09,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1429877763, now seen corresponding path program 3 times
[2024-06-14 16:17:09,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:09,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710074644]
[2024-06-14 16:17:09,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:09,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:09,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:18,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:18,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:18,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710074644]
[2024-06-14 16:17:18,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710074644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:18,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:18,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:17:18,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255762717]
[2024-06-14 16:17:18,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:18,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:17:18,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:18,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:17:18,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:17:19,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:17:19,061 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 217 transitions, 2367 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:19,061 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:19,061 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:17:19,061 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:20,246 INFO  L124   PetriNetUnfolderBase]: 2094/3241 cut-off events.
[2024-06-14 16:17:20,246 INFO  L125   PetriNetUnfolderBase]: For 207407/207407 co-relation queries the response was YES.
[2024-06-14 16:17:20,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25161 conditions, 3241 events. 2094/3241 cut-off events. For 207407/207407 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16877 event pairs, 595 based on Foata normal form. 2/3235 useless extension candidates. Maximal degree in co-relation 25080. Up to 3027 conditions per place. 
[2024-06-14 16:17:20,269 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 202 selfloop transitions, 27 changer transitions 0/234 dead transitions.
[2024-06-14 16:17:20,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 234 transitions, 2871 flow
[2024-06-14 16:17:20,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:17:20,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:17:20,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:17:20,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119601328903654
[2024-06-14 16:17:20,270 INFO  L175             Difference]: Start difference. First operand has 170 places, 217 transitions, 2367 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:17:20,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 234 transitions, 2871 flow
[2024-06-14 16:17:20,445 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 234 transitions, 2801 flow, removed 28 selfloop flow, removed 3 redundant places.
[2024-06-14 16:17:20,448 INFO  L231             Difference]: Finished difference. Result has 174 places, 217 transitions, 2357 flow
[2024-06-14 16:17:20,448 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2357, PETRI_PLACES=174, PETRI_TRANSITIONS=217}
[2024-06-14 16:17:20,448 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 130 predicate places.
[2024-06-14 16:17:20,448 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 217 transitions, 2357 flow
[2024-06-14 16:17:20,448 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:20,449 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:20,449 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:20,449 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 16:17:20,449 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-14 16:17:20,449 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:20,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 1712292607, now seen corresponding path program 4 times
[2024-06-14 16:17:20,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:20,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402329297]
[2024-06-14 16:17:20,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:20,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:20,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:29,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:29,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:29,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402329297]
[2024-06-14 16:17:29,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402329297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:29,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:29,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:17:29,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236072619]
[2024-06-14 16:17:29,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:29,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:17:29,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:29,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:17:29,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:17:30,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:17:30,108 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 217 transitions, 2357 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:30,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:30,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:17:30,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:31,310 INFO  L124   PetriNetUnfolderBase]: 2078/3218 cut-off events.
[2024-06-14 16:17:31,310 INFO  L125   PetriNetUnfolderBase]: For 212903/212903 co-relation queries the response was YES.
[2024-06-14 16:17:31,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25026 conditions, 3218 events. 2078/3218 cut-off events. For 212903/212903 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16739 event pairs, 582 based on Foata normal form. 4/3218 useless extension candidates. Maximal degree in co-relation 24943. Up to 2953 conditions per place. 
[2024-06-14 16:17:31,336 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 198 selfloop transitions, 40 changer transitions 0/243 dead transitions.
[2024-06-14 16:17:31,337 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 243 transitions, 2905 flow
[2024-06-14 16:17:31,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:17:31,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:17:31,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-14 16:17:31,338 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4108527131782946
[2024-06-14 16:17:31,338 INFO  L175             Difference]: Start difference. First operand has 174 places, 217 transitions, 2357 flow. Second operand 9 states and 159 transitions.
[2024-06-14 16:17:31,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 243 transitions, 2905 flow
[2024-06-14 16:17:31,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 243 transitions, 2819 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 16:17:31,546 INFO  L231             Difference]: Finished difference. Result has 177 places, 217 transitions, 2359 flow
[2024-06-14 16:17:31,551 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2359, PETRI_PLACES=177, PETRI_TRANSITIONS=217}
[2024-06-14 16:17:31,551 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places.
[2024-06-14 16:17:31,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 217 transitions, 2359 flow
[2024-06-14 16:17:31,551 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:31,551 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:31,551 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:31,551 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 16:17:31,552 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-14 16:17:31,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:31,552 INFO  L85        PathProgramCache]: Analyzing trace with hash -478051585, now seen corresponding path program 5 times
[2024-06-14 16:17:31,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:31,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108865198]
[2024-06-14 16:17:31,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:31,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:31,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:41,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:41,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:41,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108865198]
[2024-06-14 16:17:41,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108865198] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:41,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:41,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:17:41,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327026840]
[2024-06-14 16:17:41,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:41,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:17:41,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:41,355 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:17:41,355 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:17:41,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:17:41,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 217 transitions, 2359 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:41,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:41,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:17:41,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:42,755 INFO  L124   PetriNetUnfolderBase]: 2112/3269 cut-off events.
[2024-06-14 16:17:42,755 INFO  L125   PetriNetUnfolderBase]: For 224191/224194 co-relation queries the response was YES.
[2024-06-14 16:17:42,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25560 conditions, 3269 events. 2112/3269 cut-off events. For 224191/224194 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17070 event pairs, 575 based on Foata normal form. 6/3271 useless extension candidates. Maximal degree in co-relation 25477. Up to 2749 conditions per place. 
[2024-06-14 16:17:42,777 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 153 selfloop transitions, 88 changer transitions 0/246 dead transitions.
[2024-06-14 16:17:42,778 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 246 transitions, 3199 flow
[2024-06-14 16:17:42,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:17:42,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:17:42,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 16:17:42,779 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-14 16:17:42,779 INFO  L175             Difference]: Start difference. First operand has 177 places, 217 transitions, 2359 flow. Second operand 8 states and 151 transitions.
[2024-06-14 16:17:42,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 246 transitions, 3199 flow
[2024-06-14 16:17:42,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 246 transitions, 3089 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-14 16:17:42,971 INFO  L231             Difference]: Finished difference. Result has 177 places, 224 transitions, 2544 flow
[2024-06-14 16:17:42,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2544, PETRI_PLACES=177, PETRI_TRANSITIONS=224}
[2024-06-14 16:17:42,972 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places.
[2024-06-14 16:17:42,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 224 transitions, 2544 flow
[2024-06-14 16:17:42,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:42,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:42,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:42,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 16:17:42,973 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-14 16:17:42,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:42,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -1965484731, now seen corresponding path program 6 times
[2024-06-14 16:17:42,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:42,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249116305]
[2024-06-14 16:17:42,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:42,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:43,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:52,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:52,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:52,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249116305]
[2024-06-14 16:17:52,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249116305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:52,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:52,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:17:52,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131923388]
[2024-06-14 16:17:52,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:52,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:17:52,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:52,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:17:52,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:17:52,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:17:52,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 224 transitions, 2544 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:52,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:52,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:17:52,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:53,669 INFO  L124   PetriNetUnfolderBase]: 2088/3242 cut-off events.
[2024-06-14 16:17:53,669 INFO  L125   PetriNetUnfolderBase]: For 226892/226895 co-relation queries the response was YES.
[2024-06-14 16:17:53,680 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25440 conditions, 3242 events. 2088/3242 cut-off events. For 226892/226895 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16920 event pairs, 567 based on Foata normal form. 6/3244 useless extension candidates. Maximal degree in co-relation 25356. Up to 2733 conditions per place. 
[2024-06-14 16:17:53,690 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 157 selfloop transitions, 83 changer transitions 0/245 dead transitions.
[2024-06-14 16:17:53,691 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 245 transitions, 3182 flow
[2024-06-14 16:17:53,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:17:53,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:17:53,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 16:17:53,692 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.436046511627907
[2024-06-14 16:17:53,692 INFO  L175             Difference]: Start difference. First operand has 177 places, 224 transitions, 2544 flow. Second operand 8 states and 150 transitions.
[2024-06-14 16:17:53,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 245 transitions, 3182 flow
[2024-06-14 16:17:53,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 245 transitions, 2872 flow, removed 49 selfloop flow, removed 7 redundant places.
[2024-06-14 16:17:53,943 INFO  L231             Difference]: Finished difference. Result has 178 places, 224 transitions, 2413 flow
[2024-06-14 16:17:53,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2413, PETRI_PLACES=178, PETRI_TRANSITIONS=224}
[2024-06-14 16:17:53,946 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 134 predicate places.
[2024-06-14 16:17:53,946 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 224 transitions, 2413 flow
[2024-06-14 16:17:53,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:53,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:53,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:53,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 16:17:53,951 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-14 16:17:53,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:53,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -463310527, now seen corresponding path program 1 times
[2024-06-14 16:17:53,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:53,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418701243]
[2024-06-14 16:17:53,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:53,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:53,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:03,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:03,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:03,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418701243]
[2024-06-14 16:18:03,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418701243] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:03,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:03,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:03,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320862439]
[2024-06-14 16:18:03,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:03,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:03,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:03,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:03,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:03,740 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:18:03,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 224 transitions, 2413 flow. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:03,741 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:03,741 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:18:03,741 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:04,891 INFO  L124   PetriNetUnfolderBase]: 2105/3272 cut-off events.
[2024-06-14 16:18:04,892 INFO  L125   PetriNetUnfolderBase]: For 230320/230323 co-relation queries the response was YES.
[2024-06-14 16:18:04,905 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25610 conditions, 3272 events. 2105/3272 cut-off events. For 230320/230323 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17162 event pairs, 566 based on Foata normal form. 3/3271 useless extension candidates. Maximal degree in co-relation 25526. Up to 2840 conditions per place. 
[2024-06-14 16:18:04,917 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 166 selfloop transitions, 79 changer transitions 0/250 dead transitions.
[2024-06-14 16:18:04,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 250 transitions, 3240 flow
[2024-06-14 16:18:04,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:18:04,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:18:04,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-14 16:18:04,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-14 16:18:04,919 INFO  L175             Difference]: Start difference. First operand has 178 places, 224 transitions, 2413 flow. Second operand 8 states and 148 transitions.
[2024-06-14 16:18:04,919 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 250 transitions, 3240 flow
[2024-06-14 16:18:05,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 250 transitions, 3036 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-14 16:18:05,157 INFO  L231             Difference]: Finished difference. Result has 179 places, 228 transitions, 2463 flow
[2024-06-14 16:18:05,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2463, PETRI_PLACES=179, PETRI_TRANSITIONS=228}
[2024-06-14 16:18:05,158 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places.
[2024-06-14 16:18:05,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 228 transitions, 2463 flow
[2024-06-14 16:18:05,158 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:05,158 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:05,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:05,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 16:18:05,159 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:05,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:05,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -462805537, now seen corresponding path program 2 times
[2024-06-14 16:18:05,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:05,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297728783]
[2024-06-14 16:18:05,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:05,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:05,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:15,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:15,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:15,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297728783]
[2024-06-14 16:18:15,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297728783] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:15,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:15,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:15,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584302179]
[2024-06-14 16:18:15,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:15,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:15,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:15,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:15,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:15,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:18:15,513 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 228 transitions, 2463 flow. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:15,513 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:15,513 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:18:15,513 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:16,743 INFO  L124   PetriNetUnfolderBase]: 2094/3253 cut-off events.
[2024-06-14 16:18:16,743 INFO  L125   PetriNetUnfolderBase]: For 234567/234570 co-relation queries the response was YES.
[2024-06-14 16:18:16,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25499 conditions, 3253 events. 2094/3253 cut-off events. For 234567/234570 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17011 event pairs, 575 based on Foata normal form. 3/3252 useless extension candidates. Maximal degree in co-relation 25414. Up to 2769 conditions per place. 
[2024-06-14 16:18:16,771 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 167 selfloop transitions, 77 changer transitions 0/249 dead transitions.
[2024-06-14 16:18:16,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 249 transitions, 3113 flow
[2024-06-14 16:18:16,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:18:16,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:18:16,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 16:18:16,772 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4273255813953488
[2024-06-14 16:18:16,772 INFO  L175             Difference]: Start difference. First operand has 179 places, 228 transitions, 2463 flow. Second operand 8 states and 147 transitions.
[2024-06-14 16:18:16,772 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 249 transitions, 3113 flow
[2024-06-14 16:18:16,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 249 transitions, 2897 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-14 16:18:17,002 INFO  L231             Difference]: Finished difference. Result has 181 places, 228 transitions, 2409 flow
[2024-06-14 16:18:17,002 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2409, PETRI_PLACES=181, PETRI_TRANSITIONS=228}
[2024-06-14 16:18:17,002 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 137 predicate places.
[2024-06-14 16:18:17,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 228 transitions, 2409 flow
[2024-06-14 16:18:17,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:17,003 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:17,003 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:17,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 16:18:17,003 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:17,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:17,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 1504290939, now seen corresponding path program 1 times
[2024-06-14 16:18:17,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:17,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141048946]
[2024-06-14 16:18:17,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:17,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:17,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:27,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:27,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:27,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141048946]
[2024-06-14 16:18:27,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141048946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:27,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:27,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:18:27,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363562530]
[2024-06-14 16:18:27,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:27,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:18:27,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:27,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:18:27,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:18:27,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:18:27,792 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 228 transitions, 2409 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:27,792 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:27,792 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:18:27,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:28,927 INFO  L124   PetriNetUnfolderBase]: 2104/3270 cut-off events.
[2024-06-14 16:18:28,928 INFO  L125   PetriNetUnfolderBase]: For 241266/241266 co-relation queries the response was YES.
[2024-06-14 16:18:28,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25736 conditions, 3270 events. 2104/3270 cut-off events. For 241266/241266 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17130 event pairs, 543 based on Foata normal form. 2/3269 useless extension candidates. Maximal degree in co-relation 25650. Up to 3079 conditions per place. 
[2024-06-14 16:18:28,951 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 228 selfloop transitions, 16 changer transitions 0/249 dead transitions.
[2024-06-14 16:18:28,951 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 249 transitions, 2991 flow
[2024-06-14 16:18:28,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:18:28,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:18:28,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 16:18:28,952 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40863787375415284
[2024-06-14 16:18:28,952 INFO  L175             Difference]: Start difference. First operand has 181 places, 228 transitions, 2409 flow. Second operand 7 states and 123 transitions.
[2024-06-14 16:18:28,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 249 transitions, 2991 flow
[2024-06-14 16:18:29,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2793 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-14 16:18:29,272 INFO  L231             Difference]: Finished difference. Result has 182 places, 231 transitions, 2305 flow
[2024-06-14 16:18:29,273 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2305, PETRI_PLACES=182, PETRI_TRANSITIONS=231}
[2024-06-14 16:18:29,273 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places.
[2024-06-14 16:18:29,273 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 231 transitions, 2305 flow
[2024-06-14 16:18:29,273 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:29,273 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:29,273 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:29,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 16:18:29,274 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:29,274 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:29,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 1707660091, now seen corresponding path program 1 times
[2024-06-14 16:18:29,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:29,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779639406]
[2024-06-14 16:18:29,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:29,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:29,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:38,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:38,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:38,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779639406]
[2024-06-14 16:18:38,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779639406] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:38,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:38,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:18:38,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538093951]
[2024-06-14 16:18:38,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:38,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:18:38,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:38,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:18:38,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:18:38,985 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:18:38,985 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 231 transitions, 2305 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:38,985 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:38,985 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:18:38,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:40,229 INFO  L124   PetriNetUnfolderBase]: 2096/3247 cut-off events.
[2024-06-14 16:18:40,229 INFO  L125   PetriNetUnfolderBase]: For 246018/246018 co-relation queries the response was YES.
[2024-06-14 16:18:40,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25618 conditions, 3247 events. 2096/3247 cut-off events. For 246018/246018 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16931 event pairs, 569 based on Foata normal form. 2/3246 useless extension candidates. Maximal degree in co-relation 25531. Up to 2953 conditions per place. 
[2024-06-14 16:18:40,253 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 201 selfloop transitions, 52 changer transitions 0/258 dead transitions.
[2024-06-14 16:18:40,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 258 transitions, 2989 flow
[2024-06-14 16:18:40,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:18:40,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:18:40,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:18:40,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4134366925064599
[2024-06-14 16:18:40,255 INFO  L175             Difference]: Start difference. First operand has 182 places, 231 transitions, 2305 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:18:40,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 258 transitions, 2989 flow
[2024-06-14 16:18:40,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 258 transitions, 2897 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-14 16:18:40,552 INFO  L231             Difference]: Finished difference. Result has 186 places, 231 transitions, 2334 flow
[2024-06-14 16:18:40,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2334, PETRI_PLACES=186, PETRI_TRANSITIONS=231}
[2024-06-14 16:18:40,552 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 142 predicate places.
[2024-06-14 16:18:40,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 231 transitions, 2334 flow
[2024-06-14 16:18:40,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:40,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:40,553 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:40,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 16:18:40,553 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:40,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:40,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 1707659905, now seen corresponding path program 2 times
[2024-06-14 16:18:40,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:40,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874176325]
[2024-06-14 16:18:40,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:40,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:40,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:50,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:50,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:50,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874176325]
[2024-06-14 16:18:50,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874176325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:50,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:50,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:18:50,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596008123]
[2024-06-14 16:18:50,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:50,427 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:18:50,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:50,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:18:50,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:18:50,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:18:50,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 231 transitions, 2334 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:50,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:50,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:18:50,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:52,144 INFO  L124   PetriNetUnfolderBase]: 2106/3268 cut-off events.
[2024-06-14 16:18:52,145 INFO  L125   PetriNetUnfolderBase]: For 256094/256094 co-relation queries the response was YES.
[2024-06-14 16:18:52,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25977 conditions, 3268 events. 2106/3268 cut-off events. For 256094/256094 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17096 event pairs, 536 based on Foata normal form. 2/3267 useless extension candidates. Maximal degree in co-relation 25889. Up to 3065 conditions per place. 
[2024-06-14 16:18:52,177 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 225 selfloop transitions, 25 changer transitions 0/255 dead transitions.
[2024-06-14 16:18:52,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 255 transitions, 2944 flow
[2024-06-14 16:18:52,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:18:52,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:18:52,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 16:18:52,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40406976744186046
[2024-06-14 16:18:52,179 INFO  L175             Difference]: Start difference. First operand has 186 places, 231 transitions, 2334 flow. Second operand 8 states and 139 transitions.
[2024-06-14 16:18:52,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 255 transitions, 2944 flow
[2024-06-14 16:18:52,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 255 transitions, 2727 flow, removed 14 selfloop flow, removed 10 redundant places.
[2024-06-14 16:18:52,439 INFO  L231             Difference]: Finished difference. Result has 184 places, 234 transitions, 2236 flow
[2024-06-14 16:18:52,439 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2117, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2236, PETRI_PLACES=184, PETRI_TRANSITIONS=234}
[2024-06-14 16:18:52,440 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 140 predicate places.
[2024-06-14 16:18:52,440 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 234 transitions, 2236 flow
[2024-06-14 16:18:52,440 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:52,440 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:52,440 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:52,440 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 16:18:52,440 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:52,441 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:52,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -471376417, now seen corresponding path program 3 times
[2024-06-14 16:18:52,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:52,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249652199]
[2024-06-14 16:18:52,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:52,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:52,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:03,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:03,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:03,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249652199]
[2024-06-14 16:19:03,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249652199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:03,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:03,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:19:03,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477193290]
[2024-06-14 16:19:03,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:03,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:19:03,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:03,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:19:03,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:19:03,365 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:19:03,366 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 234 transitions, 2236 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:03,366 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:03,366 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:19:03,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:04,517 INFO  L124   PetriNetUnfolderBase]: 2100/3256 cut-off events.
[2024-06-14 16:19:04,518 INFO  L125   PetriNetUnfolderBase]: For 253189/253192 co-relation queries the response was YES.
[2024-06-14 16:19:04,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25717 conditions, 3256 events. 2100/3256 cut-off events. For 253189/253192 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17008 event pairs, 549 based on Foata normal form. 2/3254 useless extension candidates. Maximal degree in co-relation 25630. Up to 3042 conditions per place. 
[2024-06-14 16:19:04,542 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 220 selfloop transitions, 31 changer transitions 0/256 dead transitions.
[2024-06-14 16:19:04,543 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 256 transitions, 2852 flow
[2024-06-14 16:19:04,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:19:04,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:19:04,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 16:19:04,545 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40406976744186046
[2024-06-14 16:19:04,545 INFO  L175             Difference]: Start difference. First operand has 184 places, 234 transitions, 2236 flow. Second operand 8 states and 139 transitions.
[2024-06-14 16:19:04,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 256 transitions, 2852 flow
[2024-06-14 16:19:04,884 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 256 transitions, 2757 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-14 16:19:04,886 INFO  L231             Difference]: Finished difference. Result has 186 places, 237 transitions, 2277 flow
[2024-06-14 16:19:04,886 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2277, PETRI_PLACES=186, PETRI_TRANSITIONS=237}
[2024-06-14 16:19:04,887 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 142 predicate places.
[2024-06-14 16:19:04,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 237 transitions, 2277 flow
[2024-06-14 16:19:04,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:04,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:04,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:04,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 16:19:04,888 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:04,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:04,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 1620915293, now seen corresponding path program 1 times
[2024-06-14 16:19:04,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:04,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397683343]
[2024-06-14 16:19:04,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:04,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:04,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:15,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:15,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:15,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397683343]
[2024-06-14 16:19:15,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397683343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:15,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:15,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:19:15,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322965051]
[2024-06-14 16:19:15,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:15,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:19:15,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:15,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:19:15,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:19:15,567 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:19:15,568 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 237 transitions, 2277 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:15,568 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:15,568 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:19:15,568 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:17,128 INFO  L124   PetriNetUnfolderBase]: 2269/3533 cut-off events.
[2024-06-14 16:19:17,128 INFO  L125   PetriNetUnfolderBase]: For 304560/304560 co-relation queries the response was YES.
[2024-06-14 16:19:17,141 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28667 conditions, 3533 events. 2269/3533 cut-off events. For 304560/304560 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19141 event pairs, 488 based on Foata normal form. 16/3546 useless extension candidates. Maximal degree in co-relation 28579. Up to 2887 conditions per place. 
[2024-06-14 16:19:17,153 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 249 selfloop transitions, 31 changer transitions 0/285 dead transitions.
[2024-06-14 16:19:17,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 285 transitions, 3249 flow
[2024-06-14 16:19:17,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:19:17,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:19:17,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 16:19:17,156 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45478036175710596
[2024-06-14 16:19:17,156 INFO  L175             Difference]: Start difference. First operand has 186 places, 237 transitions, 2277 flow. Second operand 9 states and 176 transitions.
[2024-06-14 16:19:17,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 285 transitions, 3249 flow
[2024-06-14 16:19:17,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 285 transitions, 3135 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-14 16:19:17,434 INFO  L231             Difference]: Finished difference. Result has 189 places, 239 transitions, 2317 flow
[2024-06-14 16:19:17,434 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2317, PETRI_PLACES=189, PETRI_TRANSITIONS=239}
[2024-06-14 16:19:17,435 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places.
[2024-06-14 16:19:17,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 239 transitions, 2317 flow
[2024-06-14 16:19:17,435 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:17,435 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:17,435 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:17,435 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 16:19:17,435 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:17,436 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:17,436 INFO  L85        PathProgramCache]: Analyzing trace with hash 771129865, now seen corresponding path program 2 times
[2024-06-14 16:19:17,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:17,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567130122]
[2024-06-14 16:19:17,436 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:17,436 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:17,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:27,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:27,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:27,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567130122]
[2024-06-14 16:19:27,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567130122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:27,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:27,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:19:27,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297851084]
[2024-06-14 16:19:27,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:27,365 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:19:27,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:27,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:19:27,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:19:27,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:19:27,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 239 transitions, 2317 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:27,580 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:27,580 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:19:27,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:29,210 INFO  L124   PetriNetUnfolderBase]: 2327/3636 cut-off events.
[2024-06-14 16:19:29,211 INFO  L125   PetriNetUnfolderBase]: For 313847/313847 co-relation queries the response was YES.
[2024-06-14 16:19:29,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29532 conditions, 3636 events. 2327/3636 cut-off events. For 313847/313847 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19695 event pairs, 595 based on Foata normal form. 16/3649 useless extension candidates. Maximal degree in co-relation 29443. Up to 3125 conditions per place. 
[2024-06-14 16:19:29,239 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 262 selfloop transitions, 20 changer transitions 0/287 dead transitions.
[2024-06-14 16:19:29,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 287 transitions, 3257 flow
[2024-06-14 16:19:29,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:19:29,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:19:29,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 16:19:29,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-14 16:19:29,241 INFO  L175             Difference]: Start difference. First operand has 189 places, 239 transitions, 2317 flow. Second operand 9 states and 174 transitions.
[2024-06-14 16:19:29,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 287 transitions, 3257 flow
[2024-06-14 16:19:29,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 287 transitions, 3192 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-14 16:19:29,548 INFO  L231             Difference]: Finished difference. Result has 193 places, 240 transitions, 2342 flow
[2024-06-14 16:19:29,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2342, PETRI_PLACES=193, PETRI_TRANSITIONS=240}
[2024-06-14 16:19:29,549 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 149 predicate places.
[2024-06-14 16:19:29,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 240 transitions, 2342 flow
[2024-06-14 16:19:29,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:29,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:29,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:29,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 16:19:29,550 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:29,550 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:29,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 771134515, now seen corresponding path program 3 times
[2024-06-14 16:19:29,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:29,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122910658]
[2024-06-14 16:19:29,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:29,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:29,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:38,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:38,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:38,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122910658]
[2024-06-14 16:19:38,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122910658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:38,150 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:38,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:19:38,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404616701]
[2024-06-14 16:19:38,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:38,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:19:38,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:38,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:19:38,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:19:38,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:19:38,275 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 240 transitions, 2342 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:38,275 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:38,275 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:19:38,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:39,786 INFO  L124   PetriNetUnfolderBase]: 2291/3575 cut-off events.
[2024-06-14 16:19:39,786 INFO  L125   PetriNetUnfolderBase]: For 310454/310454 co-relation queries the response was YES.
[2024-06-14 16:19:39,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28311 conditions, 3575 events. 2291/3575 cut-off events. For 310454/310454 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19322 event pairs, 601 based on Foata normal form. 20/3592 useless extension candidates. Maximal degree in co-relation 28220. Up to 3199 conditions per place. 
[2024-06-14 16:19:39,815 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 241 selfloop transitions, 27 changer transitions 0/273 dead transitions.
[2024-06-14 16:19:39,816 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 273 transitions, 2992 flow
[2024-06-14 16:19:39,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:19:39,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:19:39,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 16:19:39,818 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 16:19:39,818 INFO  L175             Difference]: Start difference. First operand has 193 places, 240 transitions, 2342 flow. Second operand 8 states and 152 transitions.
[2024-06-14 16:19:39,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 273 transitions, 2992 flow
[2024-06-14 16:19:40,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 273 transitions, 2885 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-14 16:19:40,201 INFO  L231             Difference]: Finished difference. Result has 194 places, 240 transitions, 2299 flow
[2024-06-14 16:19:40,201 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2299, PETRI_PLACES=194, PETRI_TRANSITIONS=240}
[2024-06-14 16:19:40,202 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places.
[2024-06-14 16:19:40,202 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 240 transitions, 2299 flow
[2024-06-14 16:19:40,202 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:40,202 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:40,202 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:40,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 16:19:40,202 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-14 16:19:40,203 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:40,203 INFO  L85        PathProgramCache]: Analyzing trace with hash -1710841967, now seen corresponding path program 4 times
[2024-06-14 16:19:40,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:40,203 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582886316]
[2024-06-14 16:19:40,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:40,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:40,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:49,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:49,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:49,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582886316]
[2024-06-14 16:19:49,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582886316] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:49,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:49,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:19:49,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185709963]
[2024-06-14 16:19:49,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:49,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:19:49,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:49,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:19:49,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:19:49,199 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:19:49,199 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 240 transitions, 2299 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:49,199 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:49,199 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:19:49,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:50,798 INFO  L124   PetriNetUnfolderBase]: 2460/3868 cut-off events.
[2024-06-14 16:19:50,798 INFO  L125   PetriNetUnfolderBase]: For 337718/337721 co-relation queries the response was YES.
[2024-06-14 16:19:50,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30788 conditions, 3868 events. 2460/3868 cut-off events. For 337718/337721 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21413 event pairs, 554 based on Foata normal form. 16/3880 useless extension candidates. Maximal degree in co-relation 30696. Up to 3046 conditions per place. 
[2024-06-14 16:19:50,828 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 229 selfloop transitions, 57 changer transitions 0/291 dead transitions.
[2024-06-14 16:19:50,828 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 291 transitions, 3309 flow
[2024-06-14 16:19:50,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:19:50,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:19:50,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-14 16:19:50,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-14 16:19:50,830 INFO  L175             Difference]: Start difference. First operand has 194 places, 240 transitions, 2299 flow. Second operand 9 states and 184 transitions.
[2024-06-14 16:19:50,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 291 transitions, 3309 flow
[2024-06-14 16:19:51,220 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 291 transitions, 3259 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-14 16:19:51,222 INFO  L231             Difference]: Finished difference. Result has 197 places, 242 transitions, 2459 flow
[2024-06-14 16:19:51,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2459, PETRI_PLACES=197, PETRI_TRANSITIONS=242}
[2024-06-14 16:19:51,224 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places.
[2024-06-14 16:19:51,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 242 transitions, 2459 flow
[2024-06-14 16:19:51,225 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:51,225 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:51,225 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:51,225 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 16:19:51,225 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-14 16:19:51,225 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:51,225 INFO  L85        PathProgramCache]: Analyzing trace with hash -1440662545, now seen corresponding path program 5 times
[2024-06-14 16:19:51,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:51,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748049796]
[2024-06-14 16:19:51,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:51,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:51,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:00,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:00,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:00,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748049796]
[2024-06-14 16:20:00,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748049796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:00,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:00,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:20:00,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040606548]
[2024-06-14 16:20:00,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:00,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:20:00,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:00,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:20:00,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:20:00,643 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:20:00,644 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 242 transitions, 2459 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:00,644 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:00,644 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:20:00,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:02,330 INFO  L124   PetriNetUnfolderBase]: 2535/3993 cut-off events.
[2024-06-14 16:20:02,331 INFO  L125   PetriNetUnfolderBase]: For 360283/360286 co-relation queries the response was YES.
[2024-06-14 16:20:02,347 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32084 conditions, 3993 events. 2535/3993 cut-off events. For 360283/360286 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 22406 event pairs, 584 based on Foata normal form. 20/4009 useless extension candidates. Maximal degree in co-relation 31991. Up to 3370 conditions per place. 
[2024-06-14 16:20:02,361 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 226 selfloop transitions, 55 changer transitions 0/286 dead transitions.
[2024-06-14 16:20:02,362 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 286 transitions, 3211 flow
[2024-06-14 16:20:02,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:20:02,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:20:02,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 16:20:02,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625322997416021
[2024-06-14 16:20:02,364 INFO  L175             Difference]: Start difference. First operand has 197 places, 242 transitions, 2459 flow. Second operand 9 states and 179 transitions.
[2024-06-14 16:20:02,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 286 transitions, 3211 flow
[2024-06-14 16:20:02,744 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 286 transitions, 3102 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-14 16:20:02,747 INFO  L231             Difference]: Finished difference. Result has 201 places, 243 transitions, 2515 flow
[2024-06-14 16:20:02,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2515, PETRI_PLACES=201, PETRI_TRANSITIONS=243}
[2024-06-14 16:20:02,747 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 157 predicate places.
[2024-06-14 16:20:02,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 243 transitions, 2515 flow
[2024-06-14 16:20:02,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:02,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:02,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:02,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:20:02,748 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-14 16:20:02,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:02,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 670626799, now seen corresponding path program 6 times
[2024-06-14 16:20:02,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:02,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843557878]
[2024-06-14 16:20:02,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:02,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:02,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:11,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:11,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:11,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843557878]
[2024-06-14 16:20:11,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843557878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:11,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:11,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:20:11,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554478921]
[2024-06-14 16:20:11,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:11,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:20:11,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:11,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:20:11,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:20:11,769 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:20:11,769 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 243 transitions, 2515 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:11,769 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:11,769 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:20:11,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:13,483 INFO  L124   PetriNetUnfolderBase]: 2499/3937 cut-off events.
[2024-06-14 16:20:13,483 INFO  L125   PetriNetUnfolderBase]: For 343382/343385 co-relation queries the response was YES.
[2024-06-14 16:20:13,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30861 conditions, 3937 events. 2499/3937 cut-off events. For 343382/343385 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21998 event pairs, 558 based on Foata normal form. 20/3953 useless extension candidates. Maximal degree in co-relation 30766. Up to 3314 conditions per place. 
[2024-06-14 16:20:13,512 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 229 selfloop transitions, 58 changer transitions 0/292 dead transitions.
[2024-06-14 16:20:13,513 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 292 transitions, 3245 flow
[2024-06-14 16:20:13,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:20:13,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:20:13,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions.
[2024-06-14 16:20:13,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4376321353065539
[2024-06-14 16:20:13,514 INFO  L175             Difference]: Start difference. First operand has 201 places, 243 transitions, 2515 flow. Second operand 11 states and 207 transitions.
[2024-06-14 16:20:13,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 292 transitions, 3245 flow
[2024-06-14 16:20:13,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 292 transitions, 3096 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-14 16:20:13,888 INFO  L231             Difference]: Finished difference. Result has 205 places, 243 transitions, 2489 flow
[2024-06-14 16:20:13,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2366, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2489, PETRI_PLACES=205, PETRI_TRANSITIONS=243}
[2024-06-14 16:20:13,888 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places.
[2024-06-14 16:20:13,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 243 transitions, 2489 flow
[2024-06-14 16:20:13,888 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:13,888 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:13,889 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:13,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:20:13,889 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-14 16:20:13,889 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:13,889 INFO  L85        PathProgramCache]: Analyzing trace with hash -858214607, now seen corresponding path program 1 times
[2024-06-14 16:20:13,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:13,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281252]
[2024-06-14 16:20:13,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:13,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:13,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:24,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:24,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:24,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281252]
[2024-06-14 16:20:24,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:24,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:24,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:20:24,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362795239]
[2024-06-14 16:20:24,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:24,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:20:24,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:24,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:20:24,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:20:24,704 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:20:24,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 243 transitions, 2489 flow. Second operand  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:24,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:24,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:20:24,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:26,358 INFO  L124   PetriNetUnfolderBase]: 2540/4003 cut-off events.
[2024-06-14 16:20:26,358 INFO  L125   PetriNetUnfolderBase]: For 343397/343400 co-relation queries the response was YES.
[2024-06-14 16:20:26,376 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31161 conditions, 4003 events. 2540/4003 cut-off events. For 343397/343400 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22501 event pairs, 554 based on Foata normal form. 12/4011 useless extension candidates. Maximal degree in co-relation 31065. Up to 3058 conditions per place. 
[2024-06-14 16:20:26,390 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 226 selfloop transitions, 60 changer transitions 0/291 dead transitions.
[2024-06-14 16:20:26,391 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 291 transitions, 3273 flow
[2024-06-14 16:20:26,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:20:26,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:20:26,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-14 16:20:26,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44651162790697674
[2024-06-14 16:20:26,393 INFO  L175             Difference]: Start difference. First operand has 205 places, 243 transitions, 2489 flow. Second operand 10 states and 192 transitions.
[2024-06-14 16:20:26,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 291 transitions, 3273 flow
[2024-06-14 16:20:26,702 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 291 transitions, 3147 flow, removed 2 selfloop flow, removed 10 redundant places.
[2024-06-14 16:20:26,705 INFO  L231             Difference]: Finished difference. Result has 205 places, 244 transitions, 2537 flow
[2024-06-14 16:20:26,705 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2537, PETRI_PLACES=205, PETRI_TRANSITIONS=244}
[2024-06-14 16:20:26,705 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places.
[2024-06-14 16:20:26,705 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 244 transitions, 2537 flow
[2024-06-14 16:20:26,705 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:26,706 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:26,706 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:26,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 16:20:26,706 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:26,706 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:26,706 INFO  L85        PathProgramCache]: Analyzing trace with hash 1718448755, now seen corresponding path program 1 times
[2024-06-14 16:20:26,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:26,706 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679121595]
[2024-06-14 16:20:26,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:26,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:26,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:35,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:35,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:35,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679121595]
[2024-06-14 16:20:35,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679121595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:35,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:35,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:20:35,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057697509]
[2024-06-14 16:20:35,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:35,375 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:20:35,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:35,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:20:35,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:20:35,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:20:35,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 244 transitions, 2537 flow. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:35,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:35,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:20:35,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:36,826 INFO  L124   PetriNetUnfolderBase]: 2534/4001 cut-off events.
[2024-06-14 16:20:36,827 INFO  L125   PetriNetUnfolderBase]: For 336503/336503 co-relation queries the response was YES.
[2024-06-14 16:20:36,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31185 conditions, 4001 events. 2534/4001 cut-off events. For 336503/336503 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22449 event pairs, 697 based on Foata normal form. 2/4000 useless extension candidates. Maximal degree in co-relation 31088. Up to 3778 conditions per place. 
[2024-06-14 16:20:36,857 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 222 selfloop transitions, 36 changer transitions 0/263 dead transitions.
[2024-06-14 16:20:36,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 263 transitions, 3145 flow
[2024-06-14 16:20:36,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:20:36,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:20:36,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 16:20:36,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186046511627907
[2024-06-14 16:20:36,858 INFO  L175             Difference]: Start difference. First operand has 205 places, 244 transitions, 2537 flow. Second operand 7 states and 126 transitions.
[2024-06-14 16:20:36,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 263 transitions, 3145 flow
[2024-06-14 16:20:37,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 263 transitions, 2971 flow, removed 28 selfloop flow, removed 8 redundant places.
[2024-06-14 16:20:37,223 INFO  L231             Difference]: Finished difference. Result has 204 places, 247 transitions, 2510 flow
[2024-06-14 16:20:37,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2510, PETRI_PLACES=204, PETRI_TRANSITIONS=247}
[2024-06-14 16:20:37,224 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 160 predicate places.
[2024-06-14 16:20:37,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 247 transitions, 2510 flow
[2024-06-14 16:20:37,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:37,224 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:37,224 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:37,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 16:20:37,224 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:37,224 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:37,225 INFO  L85        PathProgramCache]: Analyzing trace with hash 102548020, now seen corresponding path program 1 times
[2024-06-14 16:20:37,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:37,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810490230]
[2024-06-14 16:20:37,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:37,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:37,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:46,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:46,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:46,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810490230]
[2024-06-14 16:20:46,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810490230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:46,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:46,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:46,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820500431]
[2024-06-14 16:20:46,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:46,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:46,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:46,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:46,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:46,469 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:20:46,470 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 247 transitions, 2510 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:46,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:46,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:20:46,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:47,838 INFO  L124   PetriNetUnfolderBase]: 2539/4009 cut-off events.
[2024-06-14 16:20:47,838 INFO  L125   PetriNetUnfolderBase]: For 340896/340899 co-relation queries the response was YES.
[2024-06-14 16:20:47,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31230 conditions, 4009 events. 2539/4009 cut-off events. For 340896/340899 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22524 event pairs, 702 based on Foata normal form. 1/4006 useless extension candidates. Maximal degree in co-relation 31132. Up to 3774 conditions per place. 
[2024-06-14 16:20:47,869 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 237 selfloop transitions, 28 changer transitions 0/270 dead transitions.
[2024-06-14 16:20:47,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 270 transitions, 3136 flow
[2024-06-14 16:20:47,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:20:47,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:20:47,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 16:20:47,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 16:20:47,871 INFO  L175             Difference]: Start difference. First operand has 204 places, 247 transitions, 2510 flow. Second operand 7 states and 129 transitions.
[2024-06-14 16:20:47,871 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 270 transitions, 3136 flow
[2024-06-14 16:20:48,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 270 transitions, 3041 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-14 16:20:48,190 INFO  L231             Difference]: Finished difference. Result has 206 places, 250 transitions, 2529 flow
[2024-06-14 16:20:48,190 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2529, PETRI_PLACES=206, PETRI_TRANSITIONS=250}
[2024-06-14 16:20:48,190 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 162 predicate places.
[2024-06-14 16:20:48,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 250 transitions, 2529 flow
[2024-06-14 16:20:48,191 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:48,191 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:48,191 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:48,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 16:20:48,191 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-14 16:20:48,191 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:48,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 1066807773, now seen corresponding path program 7 times
[2024-06-14 16:20:48,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:48,192 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238053461]
[2024-06-14 16:20:48,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:48,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:48,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:57,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:57,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:57,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238053461]
[2024-06-14 16:20:57,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238053461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:57,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:57,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:20:57,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812637381]
[2024-06-14 16:20:57,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:57,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:20:57,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:57,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:20:57,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:20:57,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:20:57,511 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 250 transitions, 2529 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:57,511 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:57,511 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:20:57,511 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:59,209 INFO  L124   PetriNetUnfolderBase]: 2614/4136 cut-off events.
[2024-06-14 16:20:59,209 INFO  L125   PetriNetUnfolderBase]: For 379800/379800 co-relation queries the response was YES.
[2024-06-14 16:20:59,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32285 conditions, 4136 events. 2614/4136 cut-off events. For 379800/379800 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23393 event pairs, 573 based on Foata normal form. 20/4153 useless extension candidates. Maximal degree in co-relation 32186. Up to 3509 conditions per place. 
[2024-06-14 16:20:59,240 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 239 selfloop transitions, 56 changer transitions 0/300 dead transitions.
[2024-06-14 16:20:59,240 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 300 transitions, 3325 flow
[2024-06-14 16:20:59,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:20:59,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:20:59,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions.
[2024-06-14 16:20:59,243 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4397463002114165
[2024-06-14 16:20:59,243 INFO  L175             Difference]: Start difference. First operand has 206 places, 250 transitions, 2529 flow. Second operand 11 states and 208 transitions.
[2024-06-14 16:20:59,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 300 transitions, 3325 flow
[2024-06-14 16:20:59,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 300 transitions, 3259 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-14 16:20:59,643 INFO  L231             Difference]: Finished difference. Result has 211 places, 251 transitions, 2632 flow
[2024-06-14 16:20:59,643 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2463, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2632, PETRI_PLACES=211, PETRI_TRANSITIONS=251}
[2024-06-14 16:20:59,644 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 167 predicate places.
[2024-06-14 16:20:59,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 251 transitions, 2632 flow
[2024-06-14 16:20:59,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:59,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:59,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:59,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 16:20:59,644 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:59,645 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:59,645 INFO  L85        PathProgramCache]: Analyzing trace with hash -1791454287, now seen corresponding path program 8 times
[2024-06-14 16:20:59,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:59,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563599529]
[2024-06-14 16:20:59,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:59,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:59,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:09,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:09,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:09,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563599529]
[2024-06-14 16:21:09,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563599529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:09,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:09,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:21:09,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895047796]
[2024-06-14 16:21:09,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:09,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:21:09,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:09,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:21:09,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:21:10,079 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:21:10,079 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 251 transitions, 2632 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:10,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:10,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:21:10,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:11,970 INFO  L124   PetriNetUnfolderBase]: 2733/4347 cut-off events.
[2024-06-14 16:21:11,971 INFO  L125   PetriNetUnfolderBase]: For 399703/399703 co-relation queries the response was YES.
[2024-06-14 16:21:11,991 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34581 conditions, 4347 events. 2733/4347 cut-off events. For 399703/399703 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 25012 event pairs, 597 based on Foata normal form. 16/4360 useless extension candidates. Maximal degree in co-relation 34482. Up to 3391 conditions per place. 
[2024-06-14 16:21:12,005 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 242 selfloop transitions, 61 changer transitions 0/308 dead transitions.
[2024-06-14 16:21:12,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 308 transitions, 3724 flow
[2024-06-14 16:21:12,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:21:12,007 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:21:12,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions.
[2024-06-14 16:21:12,007 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4503171247357294
[2024-06-14 16:21:12,007 INFO  L175             Difference]: Start difference. First operand has 211 places, 251 transitions, 2632 flow. Second operand 11 states and 213 transitions.
[2024-06-14 16:21:12,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 308 transitions, 3724 flow
[2024-06-14 16:21:12,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 308 transitions, 3583 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-06-14 16:21:12,425 INFO  L231             Difference]: Finished difference. Result has 213 places, 253 transitions, 2721 flow
[2024-06-14 16:21:12,425 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2721, PETRI_PLACES=213, PETRI_TRANSITIONS=253}
[2024-06-14 16:21:12,425 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 169 predicate places.
[2024-06-14 16:21:12,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 253 transitions, 2721 flow
[2024-06-14 16:21:12,425 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:12,425 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:12,426 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:12,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 16:21:12,426 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:12,426 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:12,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -1791276657, now seen corresponding path program 9 times
[2024-06-14 16:21:12,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:12,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864812486]
[2024-06-14 16:21:12,426 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:12,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:12,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:22,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:22,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:22,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864812486]
[2024-06-14 16:21:22,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864812486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:22,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:22,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:21:22,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167755850]
[2024-06-14 16:21:22,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:22,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:21:22,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:22,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:21:22,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:21:22,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:21:22,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 253 transitions, 2721 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:22,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:22,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:21:22,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:24,700 INFO  L124   PetriNetUnfolderBase]: 2808/4472 cut-off events.
[2024-06-14 16:21:24,700 INFO  L125   PetriNetUnfolderBase]: For 419922/419922 co-relation queries the response was YES.
[2024-06-14 16:21:24,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35501 conditions, 4472 events. 2808/4472 cut-off events. For 419922/419922 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25936 event pairs, 627 based on Foata normal form. 20/4489 useless extension candidates. Maximal degree in co-relation 35401. Up to 3835 conditions per place. 
[2024-06-14 16:21:24,745 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 240 selfloop transitions, 58 changer transitions 0/303 dead transitions.
[2024-06-14 16:21:24,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 303 transitions, 3527 flow
[2024-06-14 16:21:24,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:21:24,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:21:24,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions.
[2024-06-14 16:21:24,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4397463002114165
[2024-06-14 16:21:24,748 INFO  L175             Difference]: Start difference. First operand has 213 places, 253 transitions, 2721 flow. Second operand 11 states and 208 transitions.
[2024-06-14 16:21:24,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 303 transitions, 3527 flow
[2024-06-14 16:21:25,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 303 transitions, 3402 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-14 16:21:25,218 INFO  L231             Difference]: Finished difference. Result has 217 places, 254 transitions, 2773 flow
[2024-06-14 16:21:25,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2604, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2773, PETRI_PLACES=217, PETRI_TRANSITIONS=254}
[2024-06-14 16:21:25,219 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 173 predicate places.
[2024-06-14 16:21:25,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 254 transitions, 2773 flow
[2024-06-14 16:21:25,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:25,219 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:25,219 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:25,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 16:21:25,219 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:25,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:25,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -183274513, now seen corresponding path program 10 times
[2024-06-14 16:21:25,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:25,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775332394]
[2024-06-14 16:21:25,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:25,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:25,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:37,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:37,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:37,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775332394]
[2024-06-14 16:21:37,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775332394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:37,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:37,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:21:37,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124465748]
[2024-06-14 16:21:37,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:37,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:21:37,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:37,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:21:37,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:21:37,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:21:37,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 254 transitions, 2773 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:37,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:37,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:21:37,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:39,729 INFO  L124   PetriNetUnfolderBase]: 2772/4411 cut-off events.
[2024-06-14 16:21:39,730 INFO  L125   PetriNetUnfolderBase]: For 397091/397091 co-relation queries the response was YES.
[2024-06-14 16:21:39,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34031 conditions, 4411 events. 2772/4411 cut-off events. For 397091/397091 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25570 event pairs, 621 based on Foata normal form. 20/4425 useless extension candidates. Maximal degree in co-relation 33929. Up to 3779 conditions per place. 
[2024-06-14 16:21:39,761 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 235 selfloop transitions, 61 changer transitions 0/301 dead transitions.
[2024-06-14 16:21:39,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 301 transitions, 3515 flow
[2024-06-14 16:21:39,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:21:39,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:21:39,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions.
[2024-06-14 16:21:39,763 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42917547568710357
[2024-06-14 16:21:39,763 INFO  L175             Difference]: Start difference. First operand has 217 places, 254 transitions, 2773 flow. Second operand 11 states and 203 transitions.
[2024-06-14 16:21:39,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 301 transitions, 3515 flow
[2024-06-14 16:21:40,272 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 301 transitions, 3354 flow, removed 24 selfloop flow, removed 9 redundant places.
[2024-06-14 16:21:40,275 INFO  L231             Difference]: Finished difference. Result has 219 places, 254 transitions, 2741 flow
[2024-06-14 16:21:40,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2612, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2741, PETRI_PLACES=219, PETRI_TRANSITIONS=254}
[2024-06-14 16:21:40,276 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 175 predicate places.
[2024-06-14 16:21:40,276 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 254 transitions, 2741 flow
[2024-06-14 16:21:40,276 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:40,276 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:40,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:40,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 16:21:40,276 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-14 16:21:40,277 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:40,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 62361359, now seen corresponding path program 2 times
[2024-06-14 16:21:40,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:40,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338571699]
[2024-06-14 16:21:40,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:40,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:40,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:50,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:50,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:50,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338571699]
[2024-06-14 16:21:50,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338571699] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:50,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:50,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:21:50,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390914352]
[2024-06-14 16:21:50,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:50,377 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:21:50,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:50,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:21:50,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:21:50,571 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:21:50,571 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 254 transitions, 2741 flow. Second operand  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:50,571 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:50,571 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:21:50,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:52,430 INFO  L124   PetriNetUnfolderBase]: 2813/4492 cut-off events.
[2024-06-14 16:21:52,430 INFO  L125   PetriNetUnfolderBase]: For 393261/393261 co-relation queries the response was YES.
[2024-06-14 16:21:52,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34317 conditions, 4492 events. 2813/4492 cut-off events. For 393261/393261 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 26205 event pairs, 614 based on Foata normal form. 12/4501 useless extension candidates. Maximal degree in co-relation 34214. Up to 3643 conditions per place. 
[2024-06-14 16:21:52,461 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 242 selfloop transitions, 59 changer transitions 0/306 dead transitions.
[2024-06-14 16:21:52,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 306 transitions, 3575 flow
[2024-06-14 16:21:52,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:21:52,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:21:52,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions.
[2024-06-14 16:21:52,464 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 16:21:52,464 INFO  L175             Difference]: Start difference. First operand has 219 places, 254 transitions, 2741 flow. Second operand 11 states and 209 transitions.
[2024-06-14 16:21:52,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 306 transitions, 3575 flow
[2024-06-14 16:21:52,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 306 transitions, 3438 flow, removed 3 selfloop flow, removed 10 redundant places.
[2024-06-14 16:21:52,877 INFO  L231             Difference]: Finished difference. Result has 220 places, 255 transitions, 2782 flow
[2024-06-14 16:21:52,877 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2604, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2782, PETRI_PLACES=220, PETRI_TRANSITIONS=255}
[2024-06-14 16:21:52,877 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 176 predicate places.
[2024-06-14 16:21:52,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 255 transitions, 2782 flow
[2024-06-14 16:21:52,877 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:52,878 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:52,878 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:52,878 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 16:21:52,878 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:52,878 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:52,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -657114193, now seen corresponding path program 3 times
[2024-06-14 16:21:52,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:52,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115424877]
[2024-06-14 16:21:52,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:52,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:52,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:02,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:22:02,160 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:02,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115424877]
[2024-06-14 16:22:02,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115424877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:02,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:02,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:22:02,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501953570]
[2024-06-14 16:22:02,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:02,162 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:22:02,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:02,162 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:22:02,162 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:22:02,397 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:22:02,397 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 255 transitions, 2782 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:02,397 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:02,397 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:22:02,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:04,291 INFO  L124   PetriNetUnfolderBase]: 2854/4573 cut-off events.
[2024-06-14 16:22:04,291 INFO  L125   PetriNetUnfolderBase]: For 408422/408422 co-relation queries the response was YES.
[2024-06-14 16:22:04,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34991 conditions, 4573 events. 2854/4573 cut-off events. For 408422/408422 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 26972 event pairs, 636 based on Foata normal form. 12/4579 useless extension candidates. Maximal degree in co-relation 34887. Up to 3834 conditions per place. 
[2024-06-14 16:22:04,324 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 237 selfloop transitions, 63 changer transitions 0/305 dead transitions.
[2024-06-14 16:22:04,324 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 305 transitions, 3608 flow
[2024-06-14 16:22:04,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:22:04,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:22:04,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions.
[2024-06-14 16:22:04,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4334038054968288
[2024-06-14 16:22:04,326 INFO  L175             Difference]: Start difference. First operand has 220 places, 255 transitions, 2782 flow. Second operand 11 states and 205 transitions.
[2024-06-14 16:22:04,326 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 305 transitions, 3608 flow
[2024-06-14 16:22:04,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 305 transitions, 3452 flow, removed 20 selfloop flow, removed 9 redundant places.
[2024-06-14 16:22:04,845 INFO  L231             Difference]: Finished difference. Result has 222 places, 256 transitions, 2814 flow
[2024-06-14 16:22:04,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2626, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2814, PETRI_PLACES=222, PETRI_TRANSITIONS=256}
[2024-06-14 16:22:04,847 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 178 predicate places.
[2024-06-14 16:22:04,847 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 256 transitions, 2814 flow
[2024-06-14 16:22:04,847 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:04,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:04,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:04,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 16:22:04,847 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-14 16:22:04,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:04,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302343439, now seen corresponding path program 4 times
[2024-06-14 16:22:04,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:04,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277090375]
[2024-06-14 16:22:04,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:04,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:04,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:15,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:22:15,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:15,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277090375]
[2024-06-14 16:22:15,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277090375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:15,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:15,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:22:15,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324988668]
[2024-06-14 16:22:15,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:15,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:22:15,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:15,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:22:15,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:22:15,691 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:22:15,691 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 256 transitions, 2814 flow. Second operand  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:15,691 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:15,692 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:22:15,692 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:17,584 INFO  L124   PetriNetUnfolderBase]: 2834/4541 cut-off events.
[2024-06-14 16:22:17,584 INFO  L125   PetriNetUnfolderBase]: For 398530/398530 co-relation queries the response was YES.
[2024-06-14 16:22:17,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34047 conditions, 4541 events. 2834/4541 cut-off events. For 398530/398530 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 26748 event pairs, 492 based on Foata normal form. 12/4547 useless extension candidates. Maximal degree in co-relation 33942. Up to 3392 conditions per place. 
[2024-06-14 16:22:17,617 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 235 selfloop transitions, 79 changer transitions 0/319 dead transitions.
[2024-06-14 16:22:17,618 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 319 transitions, 3800 flow
[2024-06-14 16:22:17,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-14 16:22:17,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 16:22:17,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions.
[2024-06-14 16:22:17,620 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4263565891472868
[2024-06-14 16:22:17,620 INFO  L175             Difference]: Start difference. First operand has 222 places, 256 transitions, 2814 flow. Second operand 12 states and 220 transitions.
[2024-06-14 16:22:17,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 319 transitions, 3800 flow
[2024-06-14 16:22:18,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 319 transitions, 3589 flow, removed 42 selfloop flow, removed 9 redundant places.
[2024-06-14 16:22:18,173 INFO  L231             Difference]: Finished difference. Result has 226 places, 268 transitions, 3054 flow
[2024-06-14 16:22:18,174 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3054, PETRI_PLACES=226, PETRI_TRANSITIONS=268}
[2024-06-14 16:22:18,174 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 182 predicate places.
[2024-06-14 16:22:18,174 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 268 transitions, 3054 flow
[2024-06-14 16:22:18,174 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:18,174 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:18,175 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:18,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 16:22:18,175 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:22:18,175 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:18,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 1757483530, now seen corresponding path program 2 times
[2024-06-14 16:22:18,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:18,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740385556]
[2024-06-14 16:22:18,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:18,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:18,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:28,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:22:28,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:28,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740385556]
[2024-06-14 16:22:28,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740385556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:28,005 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:28,005 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:22:28,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944549819]
[2024-06-14 16:22:28,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:28,005 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:22:28,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:28,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:22:28,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:22:28,139 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:22:28,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 268 transitions, 3054 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:28,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:28,140 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:22:28,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:29,680 INFO  L124   PetriNetUnfolderBase]: 2831/4524 cut-off events.
[2024-06-14 16:22:29,680 INFO  L125   PetriNetUnfolderBase]: For 401473/401473 co-relation queries the response was YES.
[2024-06-14 16:22:29,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34807 conditions, 4524 events. 2831/4524 cut-off events. For 401473/401473 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 26589 event pairs, 786 based on Foata normal form. 1/4519 useless extension candidates. Maximal degree in co-relation 34699. Up to 4275 conditions per place. 
[2024-06-14 16:22:29,717 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 252 selfloop transitions, 28 changer transitions 0/285 dead transitions.
[2024-06-14 16:22:29,718 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 285 transitions, 3660 flow
[2024-06-14 16:22:29,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:22:29,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:22:29,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:22:29,720 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119601328903654
[2024-06-14 16:22:29,720 INFO  L175             Difference]: Start difference. First operand has 226 places, 268 transitions, 3054 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:22:29,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 285 transitions, 3660 flow
[2024-06-14 16:22:30,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 285 transitions, 3190 flow, removed 142 selfloop flow, removed 10 redundant places.
[2024-06-14 16:22:30,358 INFO  L231             Difference]: Finished difference. Result has 223 places, 268 transitions, 2650 flow
[2024-06-14 16:22:30,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2650, PETRI_PLACES=223, PETRI_TRANSITIONS=268}
[2024-06-14 16:22:30,359 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 179 predicate places.
[2024-06-14 16:22:30,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 268 transitions, 2650 flow
[2024-06-14 16:22:30,359 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:30,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:30,359 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:30,359 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 16:22:30,359 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-14 16:22:30,359 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:30,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1904229900, now seen corresponding path program 3 times
[2024-06-14 16:22:30,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:30,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982527616]
[2024-06-14 16:22:30,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:30,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:30,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:39,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-14 16:22:39,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:39,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982527616]
[2024-06-14 16:22:39,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982527616] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:39,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:39,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:22:39,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393132659]
[2024-06-14 16:22:39,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:39,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:22:39,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:39,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:22:39,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:22:39,258 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:22:39,258 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 268 transitions, 2650 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:39,258 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:39,258 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:22:39,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:40,695 INFO  L124   PetriNetUnfolderBase]: 2819/4512 cut-off events.
[2024-06-14 16:22:40,695 INFO  L125   PetriNetUnfolderBase]: For 397091/397091 co-relation queries the response was YES.
[2024-06-14 16:22:40,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31900 conditions, 4512 events. 2819/4512 cut-off events. For 397091/397091 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26513 event pairs, 772 based on Foata normal form. 2/4508 useless extension candidates. Maximal degree in co-relation 31793. Up to 4184 conditions per place. 
[2024-06-14 16:22:40,728 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 230 selfloop transitions, 48 changer transitions 0/283 dead transitions.
[2024-06-14 16:22:40,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 283 transitions, 3250 flow
[2024-06-14 16:22:40,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:22:40,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:22:40,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:22:40,730 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119601328903654
[2024-06-14 16:22:40,730 INFO  L175             Difference]: Start difference. First operand has 223 places, 268 transitions, 2650 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:22:40,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 283 transitions, 3250 flow
[2024-06-14 16:22:41,272 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 283 transitions, 3023 flow, removed 69 selfloop flow, removed 8 redundant places.
[2024-06-14 16:22:41,275 INFO  L231             Difference]: Finished difference. Result has 222 places, 268 transitions, 2533 flow
[2024-06-14 16:22:41,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2423, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2533, PETRI_PLACES=222, PETRI_TRANSITIONS=268}
[2024-06-14 16:22:41,275 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 178 predicate places.
[2024-06-14 16:22:41,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 268 transitions, 2533 flow
[2024-06-14 16:22:41,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:41,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:41,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:41,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 16:22:41,276 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-14 16:22:41,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:41,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136946157, now seen corresponding path program 1 times
[2024-06-14 16:22:41,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:41,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323136182]
[2024-06-14 16:22:41,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:41,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:41,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:50,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:22:50,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:50,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323136182]
[2024-06-14 16:22:50,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323136182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:50,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:50,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:22:50,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075161107]
[2024-06-14 16:22:50,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:50,340 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:22:50,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:50,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:22:50,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:22:50,506 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 16:22:50,506 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 268 transitions, 2533 flow. Second operand  has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:50,507 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:50,507 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 16:22:50,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:52,091 INFO  L124   PetriNetUnfolderBase]: 2843/4551 cut-off events.
[2024-06-14 16:22:52,091 INFO  L125   PetriNetUnfolderBase]: For 404929/404932 co-relation queries the response was YES.
[2024-06-14 16:22:52,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31602 conditions, 4551 events. 2843/4551 cut-off events. For 404929/404932 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 26759 event pairs, 789 based on Foata normal form. 6/4553 useless extension candidates. Maximal degree in co-relation 31496. Up to 4024 conditions per place. 
[2024-06-14 16:22:52,131 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 207 selfloop transitions, 82 changer transitions 0/294 dead transitions.
[2024-06-14 16:22:52,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 294 transitions, 3253 flow
[2024-06-14 16:22:52,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:22:52,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:22:52,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:22:52,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4134366925064599
[2024-06-14 16:22:52,132 INFO  L175             Difference]: Start difference. First operand has 222 places, 268 transitions, 2533 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:22:52,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 294 transitions, 3253 flow
[2024-06-14 16:22:52,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 294 transitions, 3093 flow, removed 1 selfloop flow, removed 8 redundant places.
[2024-06-14 16:22:52,657 INFO  L231             Difference]: Finished difference. Result has 223 places, 271 transitions, 2621 flow
[2024-06-14 16:22:52,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2373, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2621, PETRI_PLACES=223, PETRI_TRANSITIONS=271}
[2024-06-14 16:22:52,663 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 179 predicate places.
[2024-06-14 16:22:52,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 271 transitions, 2621 flow
[2024-06-14 16:22:52,663 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:52,663 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:52,664 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:52,664 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 16:22:52,664 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:22:52,664 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:52,664 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136411407, now seen corresponding path program 2 times
[2024-06-14 16:22:52,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:52,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445965262]
[2024-06-14 16:22:52,665 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:52,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:52,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15