./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_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/safe004_power.opt_pso.opt_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/safe004_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --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 15:51:43,959 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:51:44,056 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:51:44,061 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:51:44,061 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:51:44,080 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:51:44,083 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:51:44,083 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:51:44,084 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:51:44,087 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:51:44,087 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:51:44,087 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:51:44,088 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:51:44,089 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:51:44,089 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:51:44,089 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:51:44,089 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:51:44,089 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:51:44,089 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:51:44,090 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:51:44,090 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:51:44,091 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:51:44,091 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:51:44,091 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:51:44,091 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:51:44,091 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:51:44,091 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:51:44,092 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:51:44,092 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:51:44,092 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:51:44,093 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:51:44,093 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:51:44,093 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:51:44,093 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:51:44,093 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:51:44,094 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:51:44,094 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 15:51:44,315 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:51:44,330 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:51:44,333 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:51:44,334 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:51:44,335 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:51:44,335 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i
[2024-06-14 15:51:45,445 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:51:45,636 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:51:45,636 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i
[2024-06-14 15:51:45,650 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ade8ac7/52428c9320a94cd9a2336e1dc6dd50a4/FLAG0815a96b8
[2024-06-14 15:51:45,664 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ade8ac7/52428c9320a94cd9a2336e1dc6dd50a4
[2024-06-14 15:51:45,666 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:51:45,667 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:51:45,667 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/safe004_power.opt_pso.opt_rmo.opt.yml/witness.yml
[2024-06-14 15:51:45,863 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:51:45,870 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:51:45,871 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:51:45,871 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:51:45,875 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:51:45,875 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:51:45" (1/2) ...
[2024-06-14 15:51:45,876 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a61948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:51:45, skipping insertion in model container
[2024-06-14 15:51:45,876 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:51:45" (1/2) ...
[2024-06-14 15:51:45,877 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40ff9e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:51:45, skipping insertion in model container
[2024-06-14 15:51:45,877 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:51:45" (2/2) ...
[2024-06-14 15:51:45,878 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a61948a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:45, skipping insertion in model container
[2024-06-14 15:51:45,878 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:51:45" (2/2) ...
[2024-06-14 15:51:45,878 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:51:45,951 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:51:45,953 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (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_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (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) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (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_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_thd3 >= 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_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_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (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_thd3 >= 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_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (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_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_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (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_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_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 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_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 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_thd3 >= 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_thd3 >= 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_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 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_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_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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && 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_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_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_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 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$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-14 15:51:45,953 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (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_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (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) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (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_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_thd3 >= 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_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_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (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_thd3 >= 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_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (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_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_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (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_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_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 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_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 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_thd3 >= 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_thd3 >= 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_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 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_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_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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && 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_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_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_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 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$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-14 15:51:45,954 INFO  L97    edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (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_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (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) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (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_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_thd3 >= 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_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_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (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_thd3 >= 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_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (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_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_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (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_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_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 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_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 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_thd3 >= 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_thd3 >= 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_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 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_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_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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && 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_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_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_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 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$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-14 15:51:45,954 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:51:45,955 INFO  L106   edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1;
[2024-06-14 15:51:45,992 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:51:46,288 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:51:46,296 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:51:46,658 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:51:46,693 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:51:46,694 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46 WrapperNode
[2024-06-14 15:51:46,694 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:51:46,695 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:51:46,695 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:51:46,695 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:51:46,701 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,742 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,841 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-14 15:51:46,842 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:51:46,843 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:51:46,843 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:51:46,843 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:51:46,852 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,852 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,877 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,925 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 15:51:46,926 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,926 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,961 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,963 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,974 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,978 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:46,998 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:51:47,000 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:51:47,000 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:51:47,000 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:51:47,001 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (1/1) ...
[2024-06-14 15:51:47,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:51:47,012 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:51:47,039 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 15:51:47,041 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 15:51:47,068 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:51:47,068 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:51:47,068 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:51:47,068 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:51:47,069 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:51:47,069 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:51:47,069 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:51:47,069 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:51:47,069 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:51:47,069 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:51:47,069 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:51:47,069 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:51:47,070 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 15:51:47,159 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:51:47,161 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:51:48,096 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:51:48,097 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:51:48,339 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:51:48,339 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:51:48,340 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:51:48 BoogieIcfgContainer
[2024-06-14 15:51:48,340 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:51:48,342 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:51:48,342 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:51:48,345 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:51:48,345 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:51:45" (1/4) ...
[2024-06-14 15:51:48,345 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b376722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:51:48, skipping insertion in model container
[2024-06-14 15:51:48,346 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:51:45" (2/4) ...
[2024-06-14 15:51:48,346 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b376722 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:51:48, skipping insertion in model container
[2024-06-14 15:51:48,346 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:51:46" (3/4) ...
[2024-06-14 15:51:48,347 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b376722 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:51:48, skipping insertion in model container
[2024-06-14 15:51:48,347 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:51:48" (4/4) ...
[2024-06-14 15:51:48,348 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i
[2024-06-14 15:51:48,360 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:51:48,360 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:51:48,360 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:51:48,441 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:51:48,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:51:48,586 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-14 15:51:48,586 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:51:48,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:51:48,589 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:51:48,592 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-14 15:51:48,600 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:51:48,614 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;@56f57b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:51:48,614 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:51:48,648 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:51:48,648 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:51:48,648 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:51:48,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:48,649 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:48,649 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 15:51:48,653 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:48,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times
[2024-06-14 15:51:48,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:48,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91481079]
[2024-06-14 15:51:48,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:48,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:48,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:52,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:52,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:52,899 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91481079]
[2024-06-14 15:51:52,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91481079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:52,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:52,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:51:52,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860916114]
[2024-06-14 15:51:52,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:52,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:51:52,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:52,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:51:52,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:51:52,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:51:53,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 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 15:51:53,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:53,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:51:53,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:53,708 INFO  L124   PetriNetUnfolderBase]: 1152/1756 cut-off events.
[2024-06-14 15:51:53,708 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-14 15:51:53,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1756 events. 1152/1756 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8194 event pairs, 693 based on Foata normal form. 2/1710 useless extension candidates. Maximal degree in co-relation 3583. Up to 1738 conditions per place. 
[2024-06-14 15:51:53,720 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-14 15:51:53,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 177 flow
[2024-06-14 15:51:53,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:51:53,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:51:53,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-06-14 15:51:53,729 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5772357723577236
[2024-06-14 15:51:53,731 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 71 transitions.
[2024-06-14 15:51:53,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 177 flow
[2024-06-14 15:51:53,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:51:53,735 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-14 15:51:53,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-14 15:51:53,739 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-14 15:51:53,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-14 15:51:53,739 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 15:51:53,739 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:53,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:53,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:51:53,740 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 15:51:53,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:53,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 588573823, now seen corresponding path program 1 times
[2024-06-14 15:51:53,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:53,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351707278]
[2024-06-14 15:51:53,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:53,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:53,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:56,688 INFO  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 15:51:56,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:56,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351707278]
[2024-06-14 15:51:56,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351707278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:56,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:56,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 15:51:56,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301627782]
[2024-06-14 15:51:56,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:56,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 15:51:56,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:56,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 15:51:56,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 15:51:56,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:51:56,764 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 15:51:56,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:56,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:51:56,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:57,508 INFO  L124   PetriNetUnfolderBase]: 1644/2457 cut-off events.
[2024-06-14 15:51:57,508 INFO  L125   PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES.
[2024-06-14 15:51:57,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 2457 events. 1644/2457 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11113 event pairs, 1035 based on Foata normal form. 3/2458 useless extension candidates. Maximal degree in co-relation 5625. Up to 2429 conditions per place. 
[2024-06-14 15:51:57,521 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-14 15:51:57,521 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 260 flow
[2024-06-14 15:51:57,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:51:57,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:51:57,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions.
[2024-06-14 15:51:57,523 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-14 15:51:57,523 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 84 transitions.
[2024-06-14 15:51:57,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 260 flow
[2024-06-14 15:51:57,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:51:57,525 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 152 flow
[2024-06-14 15:51:57,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2024-06-14 15:51:57,525 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-14 15:51:57,526 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 152 flow
[2024-06-14 15:51:57,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 15:51:57,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:57,526 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:57,526 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:51:57,526 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 15:51:57,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:57,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times
[2024-06-14 15:51:57,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:57,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576021964]
[2024-06-14 15:51:57,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:57,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:57,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:00,353 INFO  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 15:52:00,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:00,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576021964]
[2024-06-14 15:52:00,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576021964] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:00,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:00,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:52:00,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534411316]
[2024-06-14 15:52:00,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:00,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:52:00,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:00,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:52:00,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:52:00,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:52:00,443 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 152 flow. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:00,443 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:00,443 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:52:00,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:01,221 INFO  L124   PetriNetUnfolderBase]: 1632/2439 cut-off events.
[2024-06-14 15:52:01,222 INFO  L125   PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES.
[2024-06-14 15:52:01,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 2439 events. 1632/2439 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11020 event pairs, 743 based on Foata normal form. 6/2443 useless extension candidates. Maximal degree in co-relation 6197. Up to 2381 conditions per place. 
[2024-06-14 15:52:01,235 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 10 changer transitions 0/66 dead transitions.
[2024-06-14 15:52:01,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 346 flow
[2024-06-14 15:52:01,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:52:01,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:52:01,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions.
[2024-06-14 15:52:01,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5024390243902439
[2024-06-14 15:52:01,240 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 152 flow. Second operand 5 states and 103 transitions.
[2024-06-14 15:52:01,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 346 flow
[2024-06-14 15:52:01,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 344 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-14 15:52:01,243 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 198 flow
[2024-06-14 15:52:01,243 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-06-14 15:52:01,244 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-06-14 15:52:01,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 198 flow
[2024-06-14 15:52:01,244 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:01,244 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:01,244 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:01,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:52:01,245 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:01,245 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:01,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 2146976690, now seen corresponding path program 1 times
[2024-06-14 15:52:01,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:01,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787432947]
[2024-06-14 15:52:01,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:01,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:01,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:04,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:04,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:04,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787432947]
[2024-06-14 15:52:04,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787432947] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:04,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:04,987 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:04,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359524841]
[2024-06-14 15:52:04,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:04,988 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:04,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:04,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:04,990 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:05,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:52:05,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 198 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 15:52:05,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:05,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:52:05,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:05,914 INFO  L124   PetriNetUnfolderBase]: 1623/2424 cut-off events.
[2024-06-14 15:52:05,914 INFO  L125   PetriNetUnfolderBase]: For 2223/2223 co-relation queries the response was YES.
[2024-06-14 15:52:05,918 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 2424 events. 1623/2424 cut-off events. For 2223/2223 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10903 event pairs, 579 based on Foata normal form. 6/2428 useless extension candidates. Maximal degree in co-relation 6761. Up to 2336 conditions per place. 
[2024-06-14 15:52:05,926 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-14 15:52:05,926 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 410 flow
[2024-06-14 15:52:05,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:52:05,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:52:05,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-14 15:52:05,944 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-14 15:52:05,944 INFO  L175             Difference]: Start difference. First operand has 51 places, 44 transitions, 198 flow. Second operand 6 states and 117 transitions.
[2024-06-14 15:52:05,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 410 flow
[2024-06-14 15:52:05,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 388 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:05,948 INFO  L231             Difference]: Finished difference. Result has 53 places, 45 transitions, 217 flow
[2024-06-14 15:52:05,948 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=45}
[2024-06-14 15:52:05,949 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2024-06-14 15:52:05,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 217 flow
[2024-06-14 15:52:05,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 15:52:05,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:05,949 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:05,949 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:52:05,950 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:05,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:05,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906018500, now seen corresponding path program 1 times
[2024-06-14 15:52:05,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:05,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709099171]
[2024-06-14 15:52:05,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:05,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:05,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:11,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:11,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:11,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709099171]
[2024-06-14 15:52:11,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709099171] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:11,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:11,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:52:11,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953027871]
[2024-06-14 15:52:11,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:11,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:52:11,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:11,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:52:11,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:52:11,284 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:11,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 217 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 15:52:11,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:11,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:11,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:12,028 INFO  L124   PetriNetUnfolderBase]: 1237/1933 cut-off events.
[2024-06-14 15:52:12,029 INFO  L125   PetriNetUnfolderBase]: For 2895/2931 co-relation queries the response was YES.
[2024-06-14 15:52:12,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 1933 events. 1237/1933 cut-off events. For 2895/2931 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9278 event pairs, 586 based on Foata normal form. 4/1867 useless extension candidates. Maximal degree in co-relation 5670. Up to 1810 conditions per place. 
[2024-06-14 15:52:12,040 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 10 changer transitions 0/61 dead transitions.
[2024-06-14 15:52:12,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 363 flow
[2024-06-14 15:52:12,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:52:12,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:52:12,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-14 15:52:12,043 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44878048780487806
[2024-06-14 15:52:12,043 INFO  L175             Difference]: Start difference. First operand has 53 places, 45 transitions, 217 flow. Second operand 5 states and 92 transitions.
[2024-06-14 15:52:12,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 363 flow
[2024-06-14 15:52:12,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 332 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-14 15:52:12,046 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 231 flow
[2024-06-14 15:52:12,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-06-14 15:52:12,047 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2024-06-14 15:52:12,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 231 flow
[2024-06-14 15:52:12,047 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 15:52:12,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:12,047 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:12,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:52:12,047 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 15:52:12,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:12,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081397346, now seen corresponding path program 1 times
[2024-06-14 15:52:12,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:12,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980280035]
[2024-06-14 15:52:12,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:12,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:12,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:17,769 INFO  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 15:52:17,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:17,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980280035]
[2024-06-14 15:52:17,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980280035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:17,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:17,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:17,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063117539]
[2024-06-14 15:52:17,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:17,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:17,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:17,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:17,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:17,876 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:17,876 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 231 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:17,877 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:17,877 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:17,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:18,759 INFO  L124   PetriNetUnfolderBase]: 1618/2421 cut-off events.
[2024-06-14 15:52:18,759 INFO  L125   PetriNetUnfolderBase]: For 4508/4518 co-relation queries the response was YES.
[2024-06-14 15:52:18,764 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7698 conditions, 2421 events. 1618/2421 cut-off events. For 4508/4518 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10878 event pairs, 734 based on Foata normal form. 12/2430 useless extension candidates. Maximal degree in co-relation 7674. Up to 2335 conditions per place. 
[2024-06-14 15:52:18,772 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-14 15:52:18,772 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 487 flow
[2024-06-14 15:52:18,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:52:18,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:52:18,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 15:52:18,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 15:52:18,774 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 231 flow. Second operand 6 states and 102 transitions.
[2024-06-14 15:52:18,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 487 flow
[2024-06-14 15:52:18,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 464 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:18,777 INFO  L231             Difference]: Finished difference. Result has 58 places, 57 transitions, 316 flow
[2024-06-14 15:52:18,777 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=57}
[2024-06-14 15:52:18,778 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2024-06-14 15:52:18,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 316 flow
[2024-06-14 15:52:18,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:18,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:18,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:18,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:52:18,779 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 15:52:18,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:18,779 INFO  L85        PathProgramCache]: Analyzing trace with hash 2129436313, now seen corresponding path program 1 times
[2024-06-14 15:52:18,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:18,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407878166]
[2024-06-14 15:52:18,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:18,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:18,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:24,227 INFO  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 15:52:24,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:24,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407878166]
[2024-06-14 15:52:24,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407878166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:24,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:24,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:24,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711637060]
[2024-06-14 15:52:24,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:24,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:24,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:24,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:24,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:24,324 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:24,325 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 316 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:24,325 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:24,325 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:24,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:25,202 INFO  L124   PetriNetUnfolderBase]: 1641/2455 cut-off events.
[2024-06-14 15:52:25,203 INFO  L125   PetriNetUnfolderBase]: For 6463/6463 co-relation queries the response was YES.
[2024-06-14 15:52:25,207 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 2455 events. 1641/2455 cut-off events. For 6463/6463 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11004 event pairs, 758 based on Foata normal form. 2/2455 useless extension candidates. Maximal degree in co-relation 8687. Up to 2411 conditions per place. 
[2024-06-14 15:52:25,216 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 16 changer transitions 0/86 dead transitions.
[2024-06-14 15:52:25,217 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 592 flow
[2024-06-14 15:52:25,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:52:25,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:52:25,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-14 15:52:25,219 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-14 15:52:25,219 INFO  L175             Difference]: Start difference. First operand has 58 places, 57 transitions, 316 flow. Second operand 7 states and 114 transitions.
[2024-06-14 15:52:25,220 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 592 flow
[2024-06-14 15:52:25,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 563 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-14 15:52:25,225 INFO  L231             Difference]: Finished difference. Result has 64 places, 65 transitions, 397 flow
[2024-06-14 15:52:25,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=64, PETRI_TRANSITIONS=65}
[2024-06-14 15:52:25,226 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places.
[2024-06-14 15:52:25,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 397 flow
[2024-06-14 15:52:25,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:25,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:25,226 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:25,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:52:25,227 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 15:52:25,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:25,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 830700505, now seen corresponding path program 2 times
[2024-06-14 15:52:25,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:25,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30044194]
[2024-06-14 15:52:25,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:25,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:25,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:30,465 INFO  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 15:52:30,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:30,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30044194]
[2024-06-14 15:52:30,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30044194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:30,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:30,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:30,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170637386]
[2024-06-14 15:52:30,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:30,467 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:30,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:30,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:30,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:30,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:30,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 397 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:30,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:30,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:30,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:31,450 INFO  L124   PetriNetUnfolderBase]: 1697/2534 cut-off events.
[2024-06-14 15:52:31,451 INFO  L125   PetriNetUnfolderBase]: For 8260/8260 co-relation queries the response was YES.
[2024-06-14 15:52:31,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9283 conditions, 2534 events. 1697/2534 cut-off events. For 8260/8260 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11309 event pairs, 757 based on Foata normal form. 5/2537 useless extension candidates. Maximal degree in co-relation 9254. Up to 2445 conditions per place. 
[2024-06-14 15:52:31,477 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 67 selfloop transitions, 28 changer transitions 0/98 dead transitions.
[2024-06-14 15:52:31,478 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 737 flow
[2024-06-14 15:52:31,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:52:31,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:52:31,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-14 15:52:31,481 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44308943089430897
[2024-06-14 15:52:31,482 INFO  L175             Difference]: Start difference. First operand has 64 places, 65 transitions, 397 flow. Second operand 6 states and 109 transitions.
[2024-06-14 15:52:31,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 737 flow
[2024-06-14 15:52:31,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 696 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-14 15:52:31,497 INFO  L231             Difference]: Finished difference. Result has 66 places, 77 transitions, 538 flow
[2024-06-14 15:52:31,497 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=66, PETRI_TRANSITIONS=77}
[2024-06-14 15:52:31,500 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-14 15:52:31,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 538 flow
[2024-06-14 15:52:31,504 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:31,504 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:31,505 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:31,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:52:31,505 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:31,505 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:31,505 INFO  L85        PathProgramCache]: Analyzing trace with hash 836414425, now seen corresponding path program 3 times
[2024-06-14 15:52:31,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:31,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085198052]
[2024-06-14 15:52:31,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:31,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:31,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:37,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:37,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:37,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085198052]
[2024-06-14 15:52:37,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085198052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:37,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:37,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:52:37,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884659991]
[2024-06-14 15:52:37,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:37,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:52:37,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:37,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:52:37,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:52:37,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:37,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 538 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:37,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:37,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:37,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:38,115 INFO  L124   PetriNetUnfolderBase]: 1684/2517 cut-off events.
[2024-06-14 15:52:38,115 INFO  L125   PetriNetUnfolderBase]: For 10576/10589 co-relation queries the response was YES.
[2024-06-14 15:52:38,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10315 conditions, 2517 events. 1684/2517 cut-off events. For 10576/10589 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11311 event pairs, 762 based on Foata normal form. 14/2527 useless extension candidates. Maximal degree in co-relation 10285. Up to 2407 conditions per place. 
[2024-06-14 15:52:38,128 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 24 changer transitions 0/94 dead transitions.
[2024-06-14 15:52:38,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 783 flow
[2024-06-14 15:52:38,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:52:38,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:52:38,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-14 15:52:38,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-14 15:52:38,130 INFO  L175             Difference]: Start difference. First operand has 66 places, 77 transitions, 538 flow. Second operand 6 states and 100 transitions.
[2024-06-14 15:52:38,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 783 flow
[2024-06-14 15:52:38,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 737 flow, removed 19 selfloop flow, removed 2 redundant places.
[2024-06-14 15:52:38,140 INFO  L231             Difference]: Finished difference. Result has 71 places, 79 transitions, 583 flow
[2024-06-14 15:52:38,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=583, PETRI_PLACES=71, PETRI_TRANSITIONS=79}
[2024-06-14 15:52:38,141 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places.
[2024-06-14 15:52:38,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 583 flow
[2024-06-14 15:52:38,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:38,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:38,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:38,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:52:38,141 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 15:52:38,142 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:38,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 836422361, now seen corresponding path program 1 times
[2024-06-14 15:52:38,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:38,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564151109]
[2024-06-14 15:52:38,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:38,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:38,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:43,702 INFO  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 15:52:43,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:43,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564151109]
[2024-06-14 15:52:43,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564151109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:43,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:43,703 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:52:43,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782695723]
[2024-06-14 15:52:43,703 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:43,703 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:52:43,703 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:43,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:52:43,704 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:52:43,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:43,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 583 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:43,833 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:43,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:43,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:44,650 INFO  L124   PetriNetUnfolderBase]: 1690/2526 cut-off events.
[2024-06-14 15:52:44,651 INFO  L125   PetriNetUnfolderBase]: For 10531/10544 co-relation queries the response was YES.
[2024-06-14 15:52:44,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10433 conditions, 2526 events. 1690/2526 cut-off events. For 10531/10544 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11344 event pairs, 726 based on Foata normal form. 14/2536 useless extension candidates. Maximal degree in co-relation 10400. Up to 2398 conditions per place. 
[2024-06-14 15:52:44,687 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 30 changer transitions 0/102 dead transitions.
[2024-06-14 15:52:44,687 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 865 flow
[2024-06-14 15:52:44,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:52:44,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:52:44,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-14 15:52:44,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40069686411149824
[2024-06-14 15:52:44,689 INFO  L175             Difference]: Start difference. First operand has 71 places, 79 transitions, 583 flow. Second operand 7 states and 115 transitions.
[2024-06-14 15:52:44,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 865 flow
[2024-06-14 15:52:44,695 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 829 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:44,699 INFO  L231             Difference]: Finished difference. Result has 75 places, 83 transitions, 650 flow
[2024-06-14 15:52:44,700 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=75, PETRI_TRANSITIONS=83}
[2024-06-14 15:52:44,700 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2024-06-14 15:52:44,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 650 flow
[2024-06-14 15:52:44,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:44,704 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:44,704 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:44,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:52:44,704 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 15:52:44,704 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:44,705 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102396995, now seen corresponding path program 1 times
[2024-06-14 15:52:44,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:44,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206373823]
[2024-06-14 15:52:44,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:44,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:44,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:50,058 INFO  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 15:52:50,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:50,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206373823]
[2024-06-14 15:52:50,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206373823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:50,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:50,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:52:50,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995053142]
[2024-06-14 15:52:50,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:50,059 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:52:50,059 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:50,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:52:50,059 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:52:50,163 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:50,163 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 650 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:50,163 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:50,163 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:50,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:51,150 INFO  L124   PetriNetUnfolderBase]: 1818/2704 cut-off events.
[2024-06-14 15:52:51,151 INFO  L125   PetriNetUnfolderBase]: For 13879/13879 co-relation queries the response was YES.
[2024-06-14 15:52:51,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11903 conditions, 2704 events. 1818/2704 cut-off events. For 13879/13879 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12181 event pairs, 583 based on Foata normal form. 10/2712 useless extension candidates. Maximal degree in co-relation 11869. Up to 2515 conditions per place. 
[2024-06-14 15:52:51,163 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 93 selfloop transitions, 37 changer transitions 0/133 dead transitions.
[2024-06-14 15:52:51,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 1166 flow
[2024-06-14 15:52:51,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:52:51,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:52:51,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-14 15:52:51,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-14 15:52:51,167 INFO  L175             Difference]: Start difference. First operand has 75 places, 83 transitions, 650 flow. Second operand 7 states and 133 transitions.
[2024-06-14 15:52:51,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 1166 flow
[2024-06-14 15:52:51,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1093 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-14 15:52:51,177 INFO  L231             Difference]: Finished difference. Result has 79 places, 101 transitions, 837 flow
[2024-06-14 15:52:51,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=79, PETRI_TRANSITIONS=101}
[2024-06-14 15:52:51,178 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places.
[2024-06-14 15:52:51,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 101 transitions, 837 flow
[2024-06-14 15:52:51,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:51,179 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:51,179 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:51,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:52:51,179 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 15:52:51,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:51,179 INFO  L85        PathProgramCache]: Analyzing trace with hash 739556343, now seen corresponding path program 2 times
[2024-06-14 15:52:51,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:51,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524994045]
[2024-06-14 15:52:51,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:51,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:51,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:56,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:56,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:56,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524994045]
[2024-06-14 15:52:56,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524994045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:56,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:56,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:52:56,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608993332]
[2024-06-14 15:52:56,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:56,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:52:56,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:56,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:52:56,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:52:56,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:56,946 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 101 transitions, 837 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:56,946 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:56,946 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:56,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:57,912 INFO  L124   PetriNetUnfolderBase]: 1856/2759 cut-off events.
[2024-06-14 15:52:57,913 INFO  L125   PetriNetUnfolderBase]: For 18320/18320 co-relation queries the response was YES.
[2024-06-14 15:52:57,919 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13650 conditions, 2759 events. 1856/2759 cut-off events. For 18320/18320 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12442 event pairs, 581 based on Foata normal form. 4/2761 useless extension candidates. Maximal degree in co-relation 13613. Up to 2618 conditions per place. 
[2024-06-14 15:52:57,927 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 104 selfloop transitions, 29 changer transitions 0/136 dead transitions.
[2024-06-14 15:52:57,928 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1303 flow
[2024-06-14 15:52:57,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:52:57,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:52:57,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-14 15:52:57,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4181184668989547
[2024-06-14 15:52:57,930 INFO  L175             Difference]: Start difference. First operand has 79 places, 101 transitions, 837 flow. Second operand 7 states and 120 transitions.
[2024-06-14 15:52:57,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1303 flow
[2024-06-14 15:52:57,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 136 transitions, 1253 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-14 15:52:57,945 INFO  L231             Difference]: Finished difference. Result has 85 places, 109 transitions, 954 flow
[2024-06-14 15:52:57,945 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=954, PETRI_PLACES=85, PETRI_TRANSITIONS=109}
[2024-06-14 15:52:57,945 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places.
[2024-06-14 15:52:57,946 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 109 transitions, 954 flow
[2024-06-14 15:52:57,946 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:57,946 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:57,946 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:57,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:52:57,946 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 15:52:57,947 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:57,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 159044901, now seen corresponding path program 3 times
[2024-06-14 15:52:57,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:57,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689803135]
[2024-06-14 15:52:57,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:57,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:57,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:03,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:03,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:03,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689803135]
[2024-06-14 15:53:03,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689803135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:03,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:03,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:53:03,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396095056]
[2024-06-14 15:53:03,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:03,446 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:53:03,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:03,446 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:53:03,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:53:03,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:03,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 109 transitions, 954 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:03,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:03,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:03,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:04,449 INFO  L124   PetriNetUnfolderBase]: 1928/2870 cut-off events.
[2024-06-14 15:53:04,449 INFO  L125   PetriNetUnfolderBase]: For 22923/22927 co-relation queries the response was YES.
[2024-06-14 15:53:04,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14682 conditions, 2870 events. 1928/2870 cut-off events. For 22923/22927 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13105 event pairs, 530 based on Foata normal form. 16/2881 useless extension candidates. Maximal degree in co-relation 14642. Up to 2449 conditions per place. 
[2024-06-14 15:53:04,467 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 43 changer transitions 0/149 dead transitions.
[2024-06-14 15:53:04,468 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 149 transitions, 1528 flow
[2024-06-14 15:53:04,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:53:04,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:53:04,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 15:53:04,470 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-14 15:53:04,471 INFO  L175             Difference]: Start difference. First operand has 85 places, 109 transitions, 954 flow. Second operand 7 states and 129 transitions.
[2024-06-14 15:53:04,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 149 transitions, 1528 flow
[2024-06-14 15:53:04,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 149 transitions, 1490 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-14 15:53:04,538 INFO  L231             Difference]: Finished difference. Result has 90 places, 121 transitions, 1142 flow
[2024-06-14 15:53:04,538 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1142, PETRI_PLACES=90, PETRI_TRANSITIONS=121}
[2024-06-14 15:53:04,539 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places.
[2024-06-14 15:53:04,539 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 121 transitions, 1142 flow
[2024-06-14 15:53:04,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:04,539 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:04,540 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:04,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:53:04,540 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 15:53:04,540 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:04,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 159291165, now seen corresponding path program 1 times
[2024-06-14 15:53:04,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:04,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780497137]
[2024-06-14 15:53:04,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:04,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:04,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:10,639 INFO  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 15:53:10,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:10,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780497137]
[2024-06-14 15:53:10,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780497137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:10,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:10,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:53:10,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473108256]
[2024-06-14 15:53:10,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:10,641 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:53:10,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:10,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:53:10,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:53:10,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:10,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 121 transitions, 1142 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:10,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:10,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:10,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:11,969 INFO  L124   PetriNetUnfolderBase]: 2056/3088 cut-off events.
[2024-06-14 15:53:11,969 INFO  L125   PetriNetUnfolderBase]: For 29258/29262 co-relation queries the response was YES.
[2024-06-14 15:53:11,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16730 conditions, 3088 events. 2056/3088 cut-off events. For 29258/29262 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14483 event pairs, 468 based on Foata normal form. 36/3119 useless extension candidates. Maximal degree in co-relation 16687. Up to 2555 conditions per place. 
[2024-06-14 15:53:11,985 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 114 selfloop transitions, 51 changer transitions 0/168 dead transitions.
[2024-06-14 15:53:11,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 168 transitions, 1820 flow
[2024-06-14 15:53:11,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:53:11,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:53:11,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-14 15:53:11,988 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-14 15:53:11,988 INFO  L175             Difference]: Start difference. First operand has 90 places, 121 transitions, 1142 flow. Second operand 8 states and 148 transitions.
[2024-06-14 15:53:11,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 168 transitions, 1820 flow
[2024-06-14 15:53:12,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 168 transitions, 1746 flow, removed 30 selfloop flow, removed 2 redundant places.
[2024-06-14 15:53:12,011 INFO  L231             Difference]: Finished difference. Result has 99 places, 132 transitions, 1385 flow
[2024-06-14 15:53:12,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1385, PETRI_PLACES=99, PETRI_TRANSITIONS=132}
[2024-06-14 15:53:12,013 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places.
[2024-06-14 15:53:12,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 132 transitions, 1385 flow
[2024-06-14 15:53:12,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:12,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:12,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:12,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:53:12,014 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 15:53:12,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:12,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -2131785044, now seen corresponding path program 1 times
[2024-06-14 15:53:12,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:12,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540948057]
[2024-06-14 15:53:12,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:12,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:12,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:18,265 INFO  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 15:53:18,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:18,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540948057]
[2024-06-14 15:53:18,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540948057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:18,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:18,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:53:18,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402713079]
[2024-06-14 15:53:18,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:18,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:53:18,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:18,267 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:53:18,267 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:53:18,393 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:18,394 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 132 transitions, 1385 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:18,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:18,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:18,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:19,521 INFO  L124   PetriNetUnfolderBase]: 2113/3171 cut-off events.
[2024-06-14 15:53:19,521 INFO  L125   PetriNetUnfolderBase]: For 34459/34459 co-relation queries the response was YES.
[2024-06-14 15:53:19,531 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18479 conditions, 3171 events. 2113/3171 cut-off events. For 34459/34459 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14910 event pairs, 548 based on Foata normal form. 2/3171 useless extension candidates. Maximal degree in co-relation 18431. Up to 3053 conditions per place. 
[2024-06-14 15:53:19,542 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 143 selfloop transitions, 30 changer transitions 0/176 dead transitions.
[2024-06-14 15:53:19,542 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 176 transitions, 1992 flow
[2024-06-14 15:53:19,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:53:19,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:53:19,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-14 15:53:19,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-14 15:53:19,546 INFO  L175             Difference]: Start difference. First operand has 99 places, 132 transitions, 1385 flow. Second operand 8 states and 134 transitions.
[2024-06-14 15:53:19,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 176 transitions, 1992 flow
[2024-06-14 15:53:19,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 176 transitions, 1929 flow, removed 22 selfloop flow, removed 2 redundant places.
[2024-06-14 15:53:19,582 INFO  L231             Difference]: Finished difference. Result has 106 places, 146 transitions, 1584 flow
[2024-06-14 15:53:19,582 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1584, PETRI_PLACES=106, PETRI_TRANSITIONS=146}
[2024-06-14 15:53:19,582 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places.
[2024-06-14 15:53:19,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 146 transitions, 1584 flow
[2024-06-14 15:53:19,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:19,583 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:19,583 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:19,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:53:19,583 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 15:53:19,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:19,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -1440543034, now seen corresponding path program 2 times
[2024-06-14 15:53:19,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:19,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154478130]
[2024-06-14 15:53:19,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:19,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:19,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:26,226 INFO  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 15:53:26,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:26,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154478130]
[2024-06-14 15:53:26,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154478130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:26,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:26,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:53:26,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79434952]
[2024-06-14 15:53:26,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:26,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:53:26,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:26,231 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:53:26,231 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:53:26,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:26,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 146 transitions, 1584 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:26,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:26,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:26,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:27,503 INFO  L124   PetriNetUnfolderBase]: 2108/3163 cut-off events.
[2024-06-14 15:53:27,504 INFO  L125   PetriNetUnfolderBase]: For 36962/36962 co-relation queries the response was YES.
[2024-06-14 15:53:27,516 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18658 conditions, 3163 events. 2108/3163 cut-off events. For 36962/36962 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14881 event pairs, 545 based on Foata normal form. 2/3163 useless extension candidates. Maximal degree in co-relation 18607. Up to 3019 conditions per place. 
[2024-06-14 15:53:27,529 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 33 changer transitions 0/172 dead transitions.
[2024-06-14 15:53:27,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 172 transitions, 2020 flow
[2024-06-14 15:53:27,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:53:27,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:53:27,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-14 15:53:27,532 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41114982578397213
[2024-06-14 15:53:27,532 INFO  L175             Difference]: Start difference. First operand has 106 places, 146 transitions, 1584 flow. Second operand 7 states and 118 transitions.
[2024-06-14 15:53:27,532 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 172 transitions, 2020 flow
[2024-06-14 15:53:27,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 172 transitions, 1963 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-14 15:53:27,573 INFO  L231             Difference]: Finished difference. Result has 110 places, 146 transitions, 1613 flow
[2024-06-14 15:53:27,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1613, PETRI_PLACES=110, PETRI_TRANSITIONS=146}
[2024-06-14 15:53:27,574 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places.
[2024-06-14 15:53:27,574 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 146 transitions, 1613 flow
[2024-06-14 15:53:27,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:27,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:27,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:27,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:53:27,575 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:27,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:27,576 INFO  L85        PathProgramCache]: Analyzing trace with hash -564402571, now seen corresponding path program 1 times
[2024-06-14 15:53:27,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:27,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533584561]
[2024-06-14 15:53:27,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:27,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:27,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:33,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 15:53:33,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:33,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533584561]
[2024-06-14 15:53:33,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533584561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:33,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:33,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:53:33,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339157801]
[2024-06-14 15:53:33,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:33,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:53:33,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:33,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:53:33,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:53:33,491 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:33,492 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 146 transitions, 1613 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:33,492 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:33,492 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:33,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:34,538 INFO  L124   PetriNetUnfolderBase]: 2130/3200 cut-off events.
[2024-06-14 15:53:34,538 INFO  L125   PetriNetUnfolderBase]: For 41724/41747 co-relation queries the response was YES.
[2024-06-14 15:53:34,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19143 conditions, 3200 events. 2130/3200 cut-off events. For 41724/41747 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15139 event pairs, 549 based on Foata normal form. 22/3216 useless extension candidates. Maximal degree in co-relation 19091. Up to 3036 conditions per place. 
[2024-06-14 15:53:34,566 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 139 selfloop transitions, 31 changer transitions 0/173 dead transitions.
[2024-06-14 15:53:34,566 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 173 transitions, 2079 flow
[2024-06-14 15:53:34,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:53:34,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:53:34,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-14 15:53:34,587 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-14 15:53:34,587 INFO  L175             Difference]: Start difference. First operand has 110 places, 146 transitions, 1613 flow. Second operand 7 states and 117 transitions.
[2024-06-14 15:53:34,587 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 173 transitions, 2079 flow
[2024-06-14 15:53:34,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 173 transitions, 2019 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-14 15:53:34,629 INFO  L231             Difference]: Finished difference. Result has 113 places, 150 transitions, 1684 flow
[2024-06-14 15:53:34,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1684, PETRI_PLACES=113, PETRI_TRANSITIONS=150}
[2024-06-14 15:53:34,630 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places.
[2024-06-14 15:53:34,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 150 transitions, 1684 flow
[2024-06-14 15:53:34,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:34,631 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:34,631 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:34,631 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:53:34,631 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:34,631 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:34,631 INFO  L85        PathProgramCache]: Analyzing trace with hash -181710765, now seen corresponding path program 2 times
[2024-06-14 15:53:34,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:34,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344737718]
[2024-06-14 15:53:34,632 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:34,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:34,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:40,950 INFO  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 15:53:40,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:40,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344737718]
[2024-06-14 15:53:40,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344737718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:40,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:40,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:53:40,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913363308]
[2024-06-14 15:53:40,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:40,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:53:40,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:40,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:53:40,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:53:41,067 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:41,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 150 transitions, 1684 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:41,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:41,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:41,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:42,214 INFO  L124   PetriNetUnfolderBase]: 2168/3255 cut-off events.
[2024-06-14 15:53:42,214 INFO  L125   PetriNetUnfolderBase]: For 43080/43099 co-relation queries the response was YES.
[2024-06-14 15:53:42,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19604 conditions, 3255 events. 2168/3255 cut-off events. For 43080/43099 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15375 event pairs, 554 based on Foata normal form. 12/3261 useless extension candidates. Maximal degree in co-relation 19550. Up to 2703 conditions per place. 
[2024-06-14 15:53:42,238 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 68 changer transitions 0/182 dead transitions.
[2024-06-14 15:53:42,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 182 transitions, 2342 flow
[2024-06-14 15:53:42,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:53:42,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:53:42,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 15:53:42,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:53:42,241 INFO  L175             Difference]: Start difference. First operand has 113 places, 150 transitions, 1684 flow. Second operand 7 states and 126 transitions.
[2024-06-14 15:53:42,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 182 transitions, 2342 flow
[2024-06-14 15:53:42,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 182 transitions, 2302 flow, removed 8 selfloop flow, removed 2 redundant places.
[2024-06-14 15:53:42,276 INFO  L231             Difference]: Finished difference. Result has 118 places, 156 transitions, 1875 flow
[2024-06-14 15:53:42,277 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1875, PETRI_PLACES=118, PETRI_TRANSITIONS=156}
[2024-06-14 15:53:42,277 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places.
[2024-06-14 15:53:42,277 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 156 transitions, 1875 flow
[2024-06-14 15:53:42,277 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:42,277 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:42,278 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:42,278 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:53:42,278 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:42,278 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:42,278 INFO  L85        PathProgramCache]: Analyzing trace with hash 1513260605, now seen corresponding path program 3 times
[2024-06-14 15:53:42,278 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:42,278 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046505285]
[2024-06-14 15:53:42,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:42,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:42,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:48,299 INFO  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 15:53:48,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:48,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046505285]
[2024-06-14 15:53:48,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046505285] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:48,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:48,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:53:48,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976595304]
[2024-06-14 15:53:48,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:48,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:53:48,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:48,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:53:48,301 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:53:48,403 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:48,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 156 transitions, 1875 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:48,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:48,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:48,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:49,430 INFO  L124   PetriNetUnfolderBase]: 2141/3214 cut-off events.
[2024-06-14 15:53:49,430 INFO  L125   PetriNetUnfolderBase]: For 47160/47164 co-relation queries the response was YES.
[2024-06-14 15:53:49,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19773 conditions, 3214 events. 2141/3214 cut-off events. For 47160/47164 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15114 event pairs, 544 based on Foata normal form. 12/3220 useless extension candidates. Maximal degree in co-relation 19717. Up to 2680 conditions per place. 
[2024-06-14 15:53:49,456 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 107 selfloop transitions, 76 changer transitions 0/186 dead transitions.
[2024-06-14 15:53:49,456 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 186 transitions, 2528 flow
[2024-06-14 15:53:49,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:53:49,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:53:49,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 15:53:49,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-14 15:53:49,459 INFO  L175             Difference]: Start difference. First operand has 118 places, 156 transitions, 1875 flow. Second operand 8 states and 139 transitions.
[2024-06-14 15:53:49,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 186 transitions, 2528 flow
[2024-06-14 15:53:49,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 186 transitions, 2398 flow, removed 30 selfloop flow, removed 3 redundant places.
[2024-06-14 15:53:49,514 INFO  L231             Difference]: Finished difference. Result has 124 places, 158 transitions, 1938 flow
[2024-06-14 15:53:49,514 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1938, PETRI_PLACES=124, PETRI_TRANSITIONS=158}
[2024-06-14 15:53:49,514 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places.
[2024-06-14 15:53:49,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 158 transitions, 1938 flow
[2024-06-14 15:53:49,515 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:49,515 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:49,515 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:49,515 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:53:49,515 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:49,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:49,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 643050680, now seen corresponding path program 1 times
[2024-06-14 15:53:49,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:49,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111826048]
[2024-06-14 15:53:49,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:49,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:49,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:56,145 INFO  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 15:53:56,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:56,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111826048]
[2024-06-14 15:53:56,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111826048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:56,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:56,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:53:56,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524154052]
[2024-06-14 15:53:56,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:56,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:53:56,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:56,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:53:56,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:53:56,302 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:56,302 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 158 transitions, 1938 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:56,302 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:56,302 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:56,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:57,339 INFO  L124   PetriNetUnfolderBase]: 2152/3230 cut-off events.
[2024-06-14 15:53:57,340 INFO  L125   PetriNetUnfolderBase]: For 50722/50741 co-relation queries the response was YES.
[2024-06-14 15:53:57,352 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20119 conditions, 3230 events. 2152/3230 cut-off events. For 50722/50741 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15213 event pairs, 553 based on Foata normal form. 10/3234 useless extension candidates. Maximal degree in co-relation 20061. Up to 2732 conditions per place. 
[2024-06-14 15:53:57,363 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 117 selfloop transitions, 65 changer transitions 0/185 dead transitions.
[2024-06-14 15:53:57,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 185 transitions, 2566 flow
[2024-06-14 15:53:57,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:53:57,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:53:57,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 15:53:57,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-14 15:53:57,366 INFO  L175             Difference]: Start difference. First operand has 124 places, 158 transitions, 1938 flow. Second operand 7 states and 124 transitions.
[2024-06-14 15:53:57,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 185 transitions, 2566 flow
[2024-06-14 15:53:57,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 2398 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-14 15:53:57,420 INFO  L231             Difference]: Finished difference. Result has 126 places, 161 transitions, 1950 flow
[2024-06-14 15:53:57,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1950, PETRI_PLACES=126, PETRI_TRANSITIONS=161}
[2024-06-14 15:53:57,421 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places.
[2024-06-14 15:53:57,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 1950 flow
[2024-06-14 15:53:57,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:57,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:57,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:57,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:53:57,422 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:57,423 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:57,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 642783770, now seen corresponding path program 2 times
[2024-06-14 15:53:57,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:57,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324553182]
[2024-06-14 15:53:57,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:57,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:57,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:03,556 INFO  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 15:54:03,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:03,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324553182]
[2024-06-14 15:54:03,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324553182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:03,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:03,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:54:03,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787936594]
[2024-06-14 15:54:03,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:03,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:54:03,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:03,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:54:03,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:54:03,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:03,714 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 1950 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:03,714 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:03,714 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:03,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:04,850 INFO  L124   PetriNetUnfolderBase]: 2131/3199 cut-off events.
[2024-06-14 15:54:04,851 INFO  L125   PetriNetUnfolderBase]: For 53915/53934 co-relation queries the response was YES.
[2024-06-14 15:54:04,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20007 conditions, 3199 events. 2131/3199 cut-off events. For 53915/53934 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15065 event pairs, 554 based on Foata normal form. 14/3207 useless extension candidates. Maximal degree in co-relation 19947. Up to 2786 conditions per place. 
[2024-06-14 15:54:04,880 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 122 selfloop transitions, 59 changer transitions 0/184 dead transitions.
[2024-06-14 15:54:04,880 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 184 transitions, 2466 flow
[2024-06-14 15:54:04,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:54:04,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:54:04,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 15:54:04,883 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-14 15:54:04,883 INFO  L175             Difference]: Start difference. First operand has 126 places, 161 transitions, 1950 flow. Second operand 7 states and 124 transitions.
[2024-06-14 15:54:04,883 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 184 transitions, 2466 flow
[2024-06-14 15:54:04,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 184 transitions, 2320 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-14 15:54:04,937 INFO  L231             Difference]: Finished difference. Result has 129 places, 161 transitions, 1932 flow
[2024-06-14 15:54:04,937 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1932, PETRI_PLACES=129, PETRI_TRANSITIONS=161}
[2024-06-14 15:54:04,938 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places.
[2024-06-14 15:54:04,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1932 flow
[2024-06-14 15:54:04,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:04,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:04,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:04,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:54:04,939 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:04,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:04,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 261312864, now seen corresponding path program 1 times
[2024-06-14 15:54:04,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:04,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753923888]
[2024-06-14 15:54:04,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:04,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:04,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:11,165 INFO  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 15:54:11,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:11,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753923888]
[2024-06-14 15:54:11,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753923888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:11,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:11,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:11,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856496409]
[2024-06-14 15:54:11,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:11,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:11,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:11,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:11,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:11,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:11,320 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1932 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:11,320 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:11,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:11,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:12,490 INFO  L124   PetriNetUnfolderBase]: 2178/3274 cut-off events.
[2024-06-14 15:54:12,491 INFO  L125   PetriNetUnfolderBase]: For 58016/58020 co-relation queries the response was YES.
[2024-06-14 15:54:12,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20579 conditions, 3274 events. 2178/3274 cut-off events. For 58016/58020 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15505 event pairs, 548 based on Foata normal form. 8/3280 useless extension candidates. Maximal degree in co-relation 20518. Up to 3123 conditions per place. 
[2024-06-14 15:54:12,512 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 167 selfloop transitions, 33 changer transitions 0/203 dead transitions.
[2024-06-14 15:54:12,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 203 transitions, 2546 flow
[2024-06-14 15:54:12,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:54:12,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:54:12,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-14 15:54:12,515 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4010840108401084
[2024-06-14 15:54:12,515 INFO  L175             Difference]: Start difference. First operand has 129 places, 161 transitions, 1932 flow. Second operand 9 states and 148 transitions.
[2024-06-14 15:54:12,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 203 transitions, 2546 flow
[2024-06-14 15:54:12,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 203 transitions, 2368 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-14 15:54:12,570 INFO  L231             Difference]: Finished difference. Result has 133 places, 170 transitions, 1961 flow
[2024-06-14 15:54:12,570 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1961, PETRI_PLACES=133, PETRI_TRANSITIONS=170}
[2024-06-14 15:54:12,571 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places.
[2024-06-14 15:54:12,571 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 170 transitions, 1961 flow
[2024-06-14 15:54:12,571 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:12,571 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:12,571 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:12,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:54:12,572 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 15:54:12,572 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:12,573 INFO  L85        PathProgramCache]: Analyzing trace with hash -319470718, now seen corresponding path program 2 times
[2024-06-14 15:54:12,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:12,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530295819]
[2024-06-14 15:54:12,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:12,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:12,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:18,656 INFO  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 15:54:18,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:18,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530295819]
[2024-06-14 15:54:18,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530295819] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:18,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:18,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:18,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186418761]
[2024-06-14 15:54:18,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:18,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:18,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:18,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:18,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:18,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:18,832 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 170 transitions, 1961 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:18,833 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:18,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:18,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:19,959 INFO  L124   PetriNetUnfolderBase]: 2195/3300 cut-off events.
[2024-06-14 15:54:19,959 INFO  L125   PetriNetUnfolderBase]: For 62913/62919 co-relation queries the response was YES.
[2024-06-14 15:54:19,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20980 conditions, 3300 events. 2195/3300 cut-off events. For 62913/62919 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15687 event pairs, 389 based on Foata normal form. 10/3308 useless extension candidates. Maximal degree in co-relation 20916. Up to 3097 conditions per place. 
[2024-06-14 15:54:19,983 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 164 selfloop transitions, 33 changer transitions 0/200 dead transitions.
[2024-06-14 15:54:19,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 200 transitions, 2493 flow
[2024-06-14 15:54:19,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:54:19,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:54:19,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-14 15:54:19,986 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-14 15:54:19,986 INFO  L175             Difference]: Start difference. First operand has 133 places, 170 transitions, 1961 flow. Second operand 8 states and 131 transitions.
[2024-06-14 15:54:19,986 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 200 transitions, 2493 flow
[2024-06-14 15:54:20,035 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 200 transitions, 2410 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 15:54:20,037 INFO  L231             Difference]: Finished difference. Result has 136 places, 172 transitions, 1994 flow
[2024-06-14 15:54:20,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1994, PETRI_PLACES=136, PETRI_TRANSITIONS=172}
[2024-06-14 15:54:20,038 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places.
[2024-06-14 15:54:20,038 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 172 transitions, 1994 flow
[2024-06-14 15:54:20,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:20,038 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:20,038 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:20,038 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:54:20,038 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 15:54:20,039 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:20,039 INFO  L85        PathProgramCache]: Analyzing trace with hash -319410268, now seen corresponding path program 3 times
[2024-06-14 15:54:20,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:20,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533392832]
[2024-06-14 15:54:20,039 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:20,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:20,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:26,967 INFO  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 15:54:26,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:26,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533392832]
[2024-06-14 15:54:26,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533392832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:26,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:26,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:26,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636041571]
[2024-06-14 15:54:26,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:26,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:26,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:26,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:26,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:27,140 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:27,141 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 172 transitions, 1994 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:27,141 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:27,141 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:27,141 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:28,408 INFO  L124   PetriNetUnfolderBase]: 2212/3327 cut-off events.
[2024-06-14 15:54:28,409 INFO  L125   PetriNetUnfolderBase]: For 68261/68261 co-relation queries the response was YES.
[2024-06-14 15:54:28,435 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21511 conditions, 3327 events. 2212/3327 cut-off events. For 68261/68261 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15816 event pairs, 518 based on Foata normal form. 4/3329 useless extension candidates. Maximal degree in co-relation 21446. Up to 3136 conditions per place. 
[2024-06-14 15:54:28,446 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 160 selfloop transitions, 39 changer transitions 0/202 dead transitions.
[2024-06-14 15:54:28,446 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 202 transitions, 2536 flow
[2024-06-14 15:54:28,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:54:28,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:54:28,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-14 15:54:28,449 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-14 15:54:28,449 INFO  L175             Difference]: Start difference. First operand has 136 places, 172 transitions, 1994 flow. Second operand 8 states and 132 transitions.
[2024-06-14 15:54:28,449 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 202 transitions, 2536 flow
[2024-06-14 15:54:28,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 202 transitions, 2436 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-14 15:54:28,513 INFO  L231             Difference]: Finished difference. Result has 138 places, 174 transitions, 2026 flow
[2024-06-14 15:54:28,514 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2026, PETRI_PLACES=138, PETRI_TRANSITIONS=174}
[2024-06-14 15:54:28,514 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-14 15:54:28,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 174 transitions, 2026 flow
[2024-06-14 15:54:28,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:28,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:28,516 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:28,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:54:28,516 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 15:54:28,516 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:28,516 INFO  L85        PathProgramCache]: Analyzing trace with hash 921671376, now seen corresponding path program 1 times
[2024-06-14 15:54:28,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:28,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491356839]
[2024-06-14 15:54:28,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:28,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:28,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:35,163 INFO  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 15:54:35,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:35,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491356839]
[2024-06-14 15:54:35,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491356839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:35,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:35,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:54:35,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764239011]
[2024-06-14 15:54:35,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:35,164 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:54:35,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:35,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:54:35,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:54:35,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:35,315 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 174 transitions, 2026 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:35,315 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:35,315 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:35,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:36,430 INFO  L124   PetriNetUnfolderBase]: 2192/3289 cut-off events.
[2024-06-14 15:54:36,431 INFO  L125   PetriNetUnfolderBase]: For 68277/68296 co-relation queries the response was YES.
[2024-06-14 15:54:36,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21217 conditions, 3289 events. 2192/3289 cut-off events. For 68277/68296 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15512 event pairs, 515 based on Foata normal form. 16/3301 useless extension candidates. Maximal degree in co-relation 21151. Up to 3082 conditions per place. 
[2024-06-14 15:54:36,453 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 151 selfloop transitions, 42 changer transitions 0/196 dead transitions.
[2024-06-14 15:54:36,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 196 transitions, 2496 flow
[2024-06-14 15:54:36,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:54:36,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:54:36,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-14 15:54:36,456 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-14 15:54:36,456 INFO  L175             Difference]: Start difference. First operand has 138 places, 174 transitions, 2026 flow. Second operand 7 states and 117 transitions.
[2024-06-14 15:54:36,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 196 transitions, 2496 flow
[2024-06-14 15:54:36,512 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 196 transitions, 2380 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-14 15:54:36,514 INFO  L231             Difference]: Finished difference. Result has 139 places, 174 transitions, 2008 flow
[2024-06-14 15:54:36,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2008, PETRI_PLACES=139, PETRI_TRANSITIONS=174}
[2024-06-14 15:54:36,519 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places.
[2024-06-14 15:54:36,519 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 174 transitions, 2008 flow
[2024-06-14 15:54:36,519 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:36,519 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:36,519 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:36,520 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:54:36,520 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 15:54:36,520 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:36,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -333737722, now seen corresponding path program 4 times
[2024-06-14 15:54:36,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:36,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249106349]
[2024-06-14 15:54:36,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:36,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:36,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:43,125 INFO  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 15:54:43,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:43,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249106349]
[2024-06-14 15:54:43,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249106349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:43,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:43,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:54:43,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896882282]
[2024-06-14 15:54:43,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:43,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:54:43,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:43,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:54:43,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:54:43,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:43,251 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 174 transitions, 2008 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:43,251 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:43,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:43,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:44,453 INFO  L124   PetriNetUnfolderBase]: 2344/3513 cut-off events.
[2024-06-14 15:54:44,453 INFO  L125   PetriNetUnfolderBase]: For 76023/76023 co-relation queries the response was YES.
[2024-06-14 15:54:44,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23222 conditions, 3513 events. 2344/3513 cut-off events. For 76023/76023 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16703 event pairs, 510 based on Foata normal form. 4/3512 useless extension candidates. Maximal degree in co-relation 23155. Up to 3283 conditions per place. 
[2024-06-14 15:54:44,480 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 174 selfloop transitions, 65 changer transitions 0/242 dead transitions.
[2024-06-14 15:54:44,480 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 242 transitions, 3326 flow
[2024-06-14 15:54:44,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:54:44,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:54:44,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-14 15:54:44,483 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:54:44,483 INFO  L175             Difference]: Start difference. First operand has 139 places, 174 transitions, 2008 flow. Second operand 9 states and 144 transitions.
[2024-06-14 15:54:44,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 242 transitions, 3326 flow
[2024-06-14 15:54:44,551 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 242 transitions, 3094 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-14 15:54:44,554 INFO  L231             Difference]: Finished difference. Result has 144 places, 210 transitions, 2662 flow
[2024-06-14 15:54:44,555 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2662, PETRI_PLACES=144, PETRI_TRANSITIONS=210}
[2024-06-14 15:54:44,555 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places.
[2024-06-14 15:54:44,555 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 210 transitions, 2662 flow
[2024-06-14 15:54:44,555 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:44,556 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:44,556 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:44,556 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:54:44,556 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:44,556 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:44,556 INFO  L85        PathProgramCache]: Analyzing trace with hash 610310366, now seen corresponding path program 1 times
[2024-06-14 15:54:44,556 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:44,557 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596004677]
[2024-06-14 15:54:44,557 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:44,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:44,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:54,643 INFO  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 15:54:54,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:54,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596004677]
[2024-06-14 15:54:54,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596004677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:54,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:54,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:54:54,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707430326]
[2024-06-14 15:54:54,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:54,644 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:54:54,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:54,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:54:54,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:54:54,749 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:54,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 210 transitions, 2662 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:54,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:54,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:54,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:56,021 INFO  L124   PetriNetUnfolderBase]: 2341/3511 cut-off events.
[2024-06-14 15:54:56,022 INFO  L125   PetriNetUnfolderBase]: For 76065/76069 co-relation queries the response was YES.
[2024-06-14 15:54:56,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23383 conditions, 3511 events. 2341/3511 cut-off events. For 76065/76069 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16804 event pairs, 543 based on Foata normal form. 5/3514 useless extension candidates. Maximal degree in co-relation 23312. Up to 3448 conditions per place. 
[2024-06-14 15:54:56,048 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 206 selfloop transitions, 22 changer transitions 0/231 dead transitions.
[2024-06-14 15:54:56,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 231 transitions, 3300 flow
[2024-06-14 15:54:56,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:54:56,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:54:56,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-14 15:54:56,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-14 15:54:56,049 INFO  L175             Difference]: Start difference. First operand has 144 places, 210 transitions, 2662 flow. Second operand 6 states and 98 transitions.
[2024-06-14 15:54:56,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 231 transitions, 3300 flow
[2024-06-14 15:54:56,118 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 231 transitions, 3123 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-14 15:54:56,121 INFO  L231             Difference]: Finished difference. Result has 147 places, 217 transitions, 2660 flow
[2024-06-14 15:54:56,121 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2660, PETRI_PLACES=147, PETRI_TRANSITIONS=217}
[2024-06-14 15:54:56,121 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places.
[2024-06-14 15:54:56,122 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 2660 flow
[2024-06-14 15:54:56,122 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:56,122 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:56,122 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:56,122 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:54:56,122 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 15:54:56,122 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:56,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776623708, now seen corresponding path program 5 times
[2024-06-14 15:54:56,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:56,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378778697]
[2024-06-14 15:54:56,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:56,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:56,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:03,365 INFO  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 15:55:03,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:03,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378778697]
[2024-06-14 15:55:03,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378778697] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:03,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:03,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:55:03,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240580179]
[2024-06-14 15:55:03,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:03,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:55:03,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:03,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:55:03,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:55:03,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:03,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 2660 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:03,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:03,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:03,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:04,931 INFO  L124   PetriNetUnfolderBase]: 2450/3692 cut-off events.
[2024-06-14 15:55:04,931 INFO  L125   PetriNetUnfolderBase]: For 89841/89845 co-relation queries the response was YES.
[2024-06-14 15:55:04,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24586 conditions, 3692 events. 2450/3692 cut-off events. For 89841/89845 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17900 event pairs, 537 based on Foata normal form. 32/3719 useless extension candidates. Maximal degree in co-relation 24512. Up to 2860 conditions per place. 
[2024-06-14 15:55:04,968 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 146 selfloop transitions, 101 changer transitions 0/250 dead transitions.
[2024-06-14 15:55:04,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 250 transitions, 3328 flow
[2024-06-14 15:55:04,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:04,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:04,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:55:04,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:55:04,971 INFO  L175             Difference]: Start difference. First operand has 147 places, 217 transitions, 2660 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:55:04,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 250 transitions, 3328 flow
[2024-06-14 15:55:05,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 250 transitions, 3275 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-14 15:55:05,065 INFO  L231             Difference]: Finished difference. Result has 153 places, 220 transitions, 2877 flow
[2024-06-14 15:55:05,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2877, PETRI_PLACES=153, PETRI_TRANSITIONS=220}
[2024-06-14 15:55:05,066 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places.
[2024-06-14 15:55:05,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 220 transitions, 2877 flow
[2024-06-14 15:55:05,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:05,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:05,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:05,067 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 15:55:05,067 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 15:55:05,067 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:05,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548537860, now seen corresponding path program 1 times
[2024-06-14 15:55:05,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:05,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955671098]
[2024-06-14 15:55:05,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:05,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:05,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:11,932 INFO  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 15:55:11,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:11,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955671098]
[2024-06-14 15:55:11,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955671098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:11,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:11,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:11,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720461296]
[2024-06-14 15:55:11,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:11,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:11,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:11,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:11,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:12,100 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:12,101 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 220 transitions, 2877 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:12,101 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:12,101 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:12,101 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:13,351 INFO  L124   PetriNetUnfolderBase]: 2467/3717 cut-off events.
[2024-06-14 15:55:13,352 INFO  L125   PetriNetUnfolderBase]: For 91798/91806 co-relation queries the response was YES.
[2024-06-14 15:55:13,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25679 conditions, 3717 events. 2467/3717 cut-off events. For 91798/91806 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18130 event pairs, 561 based on Foata normal form. 12/3726 useless extension candidates. Maximal degree in co-relation 25603. Up to 3560 conditions per place. 
[2024-06-14 15:55:13,378 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 211 selfloop transitions, 33 changer transitions 0/247 dead transitions.
[2024-06-14 15:55:13,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 247 transitions, 3513 flow
[2024-06-14 15:55:13,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:13,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:13,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 15:55:13,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:55:13,381 INFO  L175             Difference]: Start difference. First operand has 153 places, 220 transitions, 2877 flow. Second operand 8 states and 128 transitions.
[2024-06-14 15:55:13,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 247 transitions, 3513 flow
[2024-06-14 15:55:13,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 247 transitions, 3277 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-14 15:55:13,461 INFO  L231             Difference]: Finished difference. Result has 156 places, 224 transitions, 2786 flow
[2024-06-14 15:55:13,461 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2786, PETRI_PLACES=156, PETRI_TRANSITIONS=224}
[2024-06-14 15:55:13,462 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places.
[2024-06-14 15:55:13,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 224 transitions, 2786 flow
[2024-06-14 15:55:13,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:13,462 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:13,462 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:13,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 15:55:13,462 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 15:55:13,463 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:13,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -1540263650, now seen corresponding path program 2 times
[2024-06-14 15:55:13,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:13,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267656443]
[2024-06-14 15:55:13,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:13,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:13,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:20,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 15:55:20,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:20,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267656443]
[2024-06-14 15:55:20,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267656443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:20,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:20,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:20,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910158733]
[2024-06-14 15:55:20,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:20,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:20,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:20,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:20,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:20,654 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:20,654 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 224 transitions, 2786 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:20,654 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:20,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:20,655 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:21,984 INFO  L124   PetriNetUnfolderBase]: 2484/3744 cut-off events.
[2024-06-14 15:55:21,985 INFO  L125   PetriNetUnfolderBase]: For 95609/95617 co-relation queries the response was YES.
[2024-06-14 15:55:22,002 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25674 conditions, 3744 events. 2484/3744 cut-off events. For 95609/95617 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18267 event pairs, 566 based on Foata normal form. 12/3753 useless extension candidates. Maximal degree in co-relation 25596. Up to 3542 conditions per place. 
[2024-06-14 15:55:22,019 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 208 selfloop transitions, 42 changer transitions 0/253 dead transitions.
[2024-06-14 15:55:22,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 253 transitions, 3438 flow
[2024-06-14 15:55:22,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:55:22,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:55:22,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions.
[2024-06-14 15:55:22,022 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875338753387534
[2024-06-14 15:55:22,022 INFO  L175             Difference]: Start difference. First operand has 156 places, 224 transitions, 2786 flow. Second operand 9 states and 143 transitions.
[2024-06-14 15:55:22,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 253 transitions, 3438 flow
[2024-06-14 15:55:22,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 253 transitions, 3339 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 15:55:22,109 INFO  L231             Difference]: Finished difference. Result has 160 places, 226 transitions, 2833 flow
[2024-06-14 15:55:22,109 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2833, PETRI_PLACES=160, PETRI_TRANSITIONS=226}
[2024-06-14 15:55:22,110 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places.
[2024-06-14 15:55:22,110 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 226 transitions, 2833 flow
[2024-06-14 15:55:22,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:22,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:22,110 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:22,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 15:55:22,111 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 15:55:22,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:22,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548298850, now seen corresponding path program 3 times
[2024-06-14 15:55:22,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:22,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080766846]
[2024-06-14 15:55:22,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:22,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:22,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:29,107 INFO  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 15:55:29,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:29,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080766846]
[2024-06-14 15:55:29,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080766846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:29,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:29,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:29,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579968007]
[2024-06-14 15:55:29,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:29,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:29,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:29,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:29,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:29,259 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:29,259 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 226 transitions, 2833 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:29,259 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:29,259 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:29,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:30,502 INFO  L124   PetriNetUnfolderBase]: 2476/3732 cut-off events.
[2024-06-14 15:55:30,502 INFO  L125   PetriNetUnfolderBase]: For 100236/100244 co-relation queries the response was YES.
[2024-06-14 15:55:30,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25802 conditions, 3732 events. 2476/3732 cut-off events. For 100236/100244 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18260 event pairs, 515 based on Foata normal form. 12/3741 useless extension candidates. Maximal degree in co-relation 25723. Up to 3471 conditions per place. 
[2024-06-14 15:55:30,533 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 43 changer transitions 0/253 dead transitions.
[2024-06-14 15:55:30,533 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 253 transitions, 3488 flow
[2024-06-14 15:55:30,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:30,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:30,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-14 15:55:30,535 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3932926829268293
[2024-06-14 15:55:30,535 INFO  L175             Difference]: Start difference. First operand has 160 places, 226 transitions, 2833 flow. Second operand 8 states and 129 transitions.
[2024-06-14 15:55:30,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 253 transitions, 3488 flow
[2024-06-14 15:55:30,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 253 transitions, 3358 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-14 15:55:30,623 INFO  L231             Difference]: Finished difference. Result has 162 places, 229 transitions, 2877 flow
[2024-06-14 15:55:30,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2877, PETRI_PLACES=162, PETRI_TRANSITIONS=229}
[2024-06-14 15:55:30,623 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-14 15:55:30,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 229 transitions, 2877 flow
[2024-06-14 15:55:30,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:30,624 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:30,624 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:30,624 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 15:55:30,624 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:30,625 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:30,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 209633856, now seen corresponding path program 2 times
[2024-06-14 15:55:30,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:30,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536803118]
[2024-06-14 15:55:30,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:30,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:30,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:40,269 INFO  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 15:55:40,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:40,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536803118]
[2024-06-14 15:55:40,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536803118] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:40,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:40,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:55:40,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039907425]
[2024-06-14 15:55:40,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:40,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:55:40,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:40,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:55:40,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:55:40,413 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:40,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 229 transitions, 2877 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:40,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:40,414 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:40,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:41,682 INFO  L124   PetriNetUnfolderBase]: 2458/3707 cut-off events.
[2024-06-14 15:55:41,683 INFO  L125   PetriNetUnfolderBase]: For 98037/98041 co-relation queries the response was YES.
[2024-06-14 15:55:41,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25523 conditions, 3707 events. 2458/3707 cut-off events. For 98037/98041 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18134 event pairs, 555 based on Foata normal form. 8/3713 useless extension candidates. Maximal degree in co-relation 25442. Up to 3637 conditions per place. 
[2024-06-14 15:55:41,709 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 214 selfloop transitions, 27 changer transitions 0/244 dead transitions.
[2024-06-14 15:55:41,710 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 244 transitions, 3435 flow
[2024-06-14 15:55:41,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:55:41,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:55:41,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-14 15:55:41,711 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:55:41,711 INFO  L175             Difference]: Start difference. First operand has 162 places, 229 transitions, 2877 flow. Second operand 5 states and 90 transitions.
[2024-06-14 15:55:41,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 244 transitions, 3435 flow
[2024-06-14 15:55:41,788 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 244 transitions, 3290 flow, removed 36 selfloop flow, removed 5 redundant places.
[2024-06-14 15:55:41,792 INFO  L231             Difference]: Finished difference. Result has 162 places, 231 transitions, 2839 flow
[2024-06-14 15:55:41,792 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2732, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2839, PETRI_PLACES=162, PETRI_TRANSITIONS=231}
[2024-06-14 15:55:41,792 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-14 15:55:41,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 231 transitions, 2839 flow
[2024-06-14 15:55:41,793 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:41,793 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:41,793 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:41,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 15:55:41,793 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 15:55:41,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:41,793 INFO  L85        PathProgramCache]: Analyzing trace with hash 367399234, now seen corresponding path program 6 times
[2024-06-14 15:55:41,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:41,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050056631]
[2024-06-14 15:55:41,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:41,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:41,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:48,275 INFO  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 15:55:48,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:48,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050056631]
[2024-06-14 15:55:48,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050056631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:48,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:48,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:48,277 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150042162]
[2024-06-14 15:55:48,277 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:48,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:48,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:48,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:48,281 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:48,431 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:48,431 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 231 transitions, 2839 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:48,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:48,432 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:48,432 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:49,708 INFO  L124   PetriNetUnfolderBase]: 2510/3783 cut-off events.
[2024-06-14 15:55:49,708 INFO  L125   PetriNetUnfolderBase]: For 101882/101882 co-relation queries the response was YES.
[2024-06-14 15:55:49,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25901 conditions, 3783 events. 2510/3783 cut-off events. For 101882/101882 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18529 event pairs, 536 based on Foata normal form. 4/3785 useless extension candidates. Maximal degree in co-relation 25819. Up to 3479 conditions per place. 
[2024-06-14 15:55:49,737 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 190 selfloop transitions, 90 changer transitions 0/283 dead transitions.
[2024-06-14 15:55:49,738 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 283 transitions, 3824 flow
[2024-06-14 15:55:49,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:55:49,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:55:49,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 15:55:49,740 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 15:55:49,740 INFO  L175             Difference]: Start difference. First operand has 162 places, 231 transitions, 2839 flow. Second operand 9 states and 149 transitions.
[2024-06-14 15:55:49,740 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 283 transitions, 3824 flow
[2024-06-14 15:55:49,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 283 transitions, 3779 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-06-14 15:55:49,854 INFO  L231             Difference]: Finished difference. Result has 171 places, 251 transitions, 3379 flow
[2024-06-14 15:55:49,855 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2794, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3379, PETRI_PLACES=171, PETRI_TRANSITIONS=251}
[2024-06-14 15:55:49,855 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places.
[2024-06-14 15:55:49,855 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 251 transitions, 3379 flow
[2024-06-14 15:55:49,855 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:49,856 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:49,856 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 15:55:49,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 15:55:49,856 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 15:55:49,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:49,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088220804, now seen corresponding path program 1 times
[2024-06-14 15:55:49,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:49,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846876303]
[2024-06-14 15:55:49,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:49,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:49,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:56,120 INFO  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 15:55:56,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:56,121 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846876303]
[2024-06-14 15:55:56,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846876303] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:56,121 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:56,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:55:56,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385013201]
[2024-06-14 15:55:56,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:56,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:55:56,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:56,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:55:56,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:55:56,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:56,273 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 251 transitions, 3379 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:56,273 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:56,273 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:56,273 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:57,617 INFO  L124   PetriNetUnfolderBase]: 2527/3813 cut-off events.
[2024-06-14 15:55:57,618 INFO  L125   PetriNetUnfolderBase]: For 112142/112175 co-relation queries the response was YES.
[2024-06-14 15:55:57,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26920 conditions, 3813 events. 2527/3813 cut-off events. For 112142/112175 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18730 event pairs, 371 based on Foata normal form. 30/3839 useless extension candidates. Maximal degree in co-relation 26834. Up to 3516 conditions per place. 
[2024-06-14 15:55:57,648 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 223 selfloop transitions, 54 changer transitions 0/280 dead transitions.
[2024-06-14 15:55:57,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 280 transitions, 4073 flow
[2024-06-14 15:55:57,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:57,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:57,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-14 15:55:57,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3932926829268293
[2024-06-14 15:55:57,651 INFO  L175             Difference]: Start difference. First operand has 171 places, 251 transitions, 3379 flow. Second operand 8 states and 129 transitions.
[2024-06-14 15:55:57,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 280 transitions, 4073 flow
[2024-06-14 15:55:57,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 280 transitions, 3933 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-14 15:55:57,760 INFO  L231             Difference]: Finished difference. Result has 175 places, 253 transitions, 3401 flow
[2024-06-14 15:55:57,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3401, PETRI_PLACES=175, PETRI_TRANSITIONS=253}
[2024-06-14 15:55:57,761 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-14 15:55:57,761 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 253 transitions, 3401 flow
[2024-06-14 15:55:57,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:57,761 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:57,761 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 15:55:57,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 15:55:57,762 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 15:55:57,762 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:57,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -1121680166, now seen corresponding path program 2 times
[2024-06-14 15:55:57,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:57,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579964894]
[2024-06-14 15:55:57,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:57,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:57,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:04,710 INFO  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 15:56:04,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:04,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579964894]
[2024-06-14 15:56:04,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579964894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:04,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:04,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:56:04,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661272592]
[2024-06-14 15:56:04,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:04,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:56:04,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:04,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:56:04,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:56:04,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:04,881 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 253 transitions, 3401 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:04,881 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:04,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:04,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:06,500 INFO  L124   PetriNetUnfolderBase]: 2544/3837 cut-off events.
[2024-06-14 15:56:06,501 INFO  L125   PetriNetUnfolderBase]: For 118458/118491 co-relation queries the response was YES.
[2024-06-14 15:56:06,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27239 conditions, 3837 events. 2544/3837 cut-off events. For 118458/118491 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18906 event pairs, 501 based on Foata normal form. 30/3863 useless extension candidates. Maximal degree in co-relation 27152. Up to 3473 conditions per place. 
[2024-06-14 15:56:06,542 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 197 selfloop transitions, 82 changer transitions 0/282 dead transitions.
[2024-06-14 15:56:06,543 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 282 transitions, 4107 flow
[2024-06-14 15:56:06,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:06,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:06,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-14 15:56:06,545 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-14 15:56:06,545 INFO  L175             Difference]: Start difference. First operand has 175 places, 253 transitions, 3401 flow. Second operand 8 states and 131 transitions.
[2024-06-14 15:56:06,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 282 transitions, 4107 flow
[2024-06-14 15:56:06,667 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 282 transitions, 3965 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-14 15:56:06,671 INFO  L231             Difference]: Finished difference. Result has 177 places, 255 transitions, 3481 flow
[2024-06-14 15:56:06,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3481, PETRI_PLACES=177, PETRI_TRANSITIONS=255}
[2024-06-14 15:56:06,671 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places.
[2024-06-14 15:56:06,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 255 transitions, 3481 flow
[2024-06-14 15:56:06,672 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:06,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:06,672 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 15:56:06,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 15:56:06,672 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 15:56:06,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:06,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108086002, now seen corresponding path program 3 times
[2024-06-14 15:56:06,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:06,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467196869]
[2024-06-14 15:56:06,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:06,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:06,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:13,972 INFO  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 15:56:13,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:13,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467196869]
[2024-06-14 15:56:13,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467196869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:13,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:13,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:56:13,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98788706]
[2024-06-14 15:56:13,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:13,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:56:13,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:13,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:56:13,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:56:14,106 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:14,106 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 255 transitions, 3481 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:14,106 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:14,106 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:14,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:15,518 INFO  L124   PetriNetUnfolderBase]: 2561/3864 cut-off events.
[2024-06-14 15:56:15,518 INFO  L125   PetriNetUnfolderBase]: For 127028/127061 co-relation queries the response was YES.
[2024-06-14 15:56:15,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27820 conditions, 3864 events. 2561/3864 cut-off events. For 127028/127061 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19081 event pairs, 501 based on Foata normal form. 30/3890 useless extension candidates. Maximal degree in co-relation 27732. Up to 3422 conditions per place. 
[2024-06-14 15:56:15,560 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 205 selfloop transitions, 76 changer transitions 0/284 dead transitions.
[2024-06-14 15:56:15,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 284 transitions, 4193 flow
[2024-06-14 15:56:15,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:15,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:15,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-14 15:56:15,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-14 15:56:15,564 INFO  L175             Difference]: Start difference. First operand has 177 places, 255 transitions, 3481 flow. Second operand 8 states and 132 transitions.
[2024-06-14 15:56:15,564 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 284 transitions, 4193 flow
[2024-06-14 15:56:15,761 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 284 transitions, 3991 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-14 15:56:15,766 INFO  L231             Difference]: Finished difference. Result has 179 places, 257 transitions, 3492 flow
[2024-06-14 15:56:15,767 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3279, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3492, PETRI_PLACES=179, PETRI_TRANSITIONS=257}
[2024-06-14 15:56:15,767 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places.
[2024-06-14 15:56:15,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 257 transitions, 3492 flow
[2024-06-14 15:56:15,767 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:15,767 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:15,767 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 15:56:15,768 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 15:56:15,768 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 15:56:15,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:15,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -272460318, now seen corresponding path program 1 times
[2024-06-14 15:56:15,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:15,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9885879]
[2024-06-14 15:56:15,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:15,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:15,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:26,505 INFO  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 15:56:26,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:26,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9885879]
[2024-06-14 15:56:26,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9885879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:26,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:26,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:56:26,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562147454]
[2024-06-14 15:56:26,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:26,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:56:26,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:26,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:56:26,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:56:26,654 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:26,654 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 257 transitions, 3492 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:26,654 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:26,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:26,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:27,945 INFO  L124   PetriNetUnfolderBase]: 2571/3882 cut-off events.
[2024-06-14 15:56:27,946 INFO  L125   PetriNetUnfolderBase]: For 132409/132417 co-relation queries the response was YES.
[2024-06-14 15:56:27,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28126 conditions, 3882 events. 2571/3882 cut-off events. For 132409/132417 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19262 event pairs, 508 based on Foata normal form. 10/3890 useless extension candidates. Maximal degree in co-relation 28037. Up to 3677 conditions per place. 
[2024-06-14 15:56:27,983 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 224 selfloop transitions, 62 changer transitions 0/289 dead transitions.
[2024-06-14 15:56:27,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 289 transitions, 4326 flow
[2024-06-14 15:56:27,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:56:27,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:56:27,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-14 15:56:27,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41114982578397213
[2024-06-14 15:56:27,985 INFO  L175             Difference]: Start difference. First operand has 179 places, 257 transitions, 3492 flow. Second operand 7 states and 118 transitions.
[2024-06-14 15:56:27,986 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 289 transitions, 4326 flow
[2024-06-14 15:56:28,202 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 289 transitions, 4131 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-14 15:56:28,206 INFO  L231             Difference]: Finished difference. Result has 181 places, 266 transitions, 3604 flow
[2024-06-14 15:56:28,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3604, PETRI_PLACES=181, PETRI_TRANSITIONS=266}
[2024-06-14 15:56:28,206 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places.
[2024-06-14 15:56:28,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 266 transitions, 3604 flow
[2024-06-14 15:56:28,207 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:28,207 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:28,207 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 15:56:28,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 15:56:28,207 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:28,208 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:28,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -1234507668, now seen corresponding path program 1 times
[2024-06-14 15:56:28,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:28,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409287489]
[2024-06-14 15:56:28,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:28,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:28,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:34,982 INFO  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 15:56:34,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:34,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409287489]
[2024-06-14 15:56:34,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409287489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:34,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:34,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:34,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104932457]
[2024-06-14 15:56:34,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:34,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:34,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:34,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:34,984 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:35,168 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:35,168 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 266 transitions, 3604 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:35,168 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:35,168 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:35,168 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:36,672 INFO  L124   PetriNetUnfolderBase]: 2765/4200 cut-off events.
[2024-06-14 15:56:36,672 INFO  L125   PetriNetUnfolderBase]: For 165561/165592 co-relation queries the response was YES.
[2024-06-14 15:56:36,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31271 conditions, 4200 events. 2765/4200 cut-off events. For 165561/165592 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21333 event pairs, 461 based on Foata normal form. 28/4222 useless extension candidates. Maximal degree in co-relation 31180. Up to 2987 conditions per place. 
[2024-06-14 15:56:36,710 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 171 selfloop transitions, 130 changer transitions 0/304 dead transitions.
[2024-06-14 15:56:36,710 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 304 transitions, 4568 flow
[2024-06-14 15:56:36,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:36,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:36,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 15:56:36,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-14 15:56:36,715 INFO  L175             Difference]: Start difference. First operand has 181 places, 266 transitions, 3604 flow. Second operand 8 states and 146 transitions.
[2024-06-14 15:56:36,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 304 transitions, 4568 flow
[2024-06-14 15:56:36,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 304 transitions, 4507 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-14 15:56:36,874 INFO  L231             Difference]: Finished difference. Result has 186 places, 268 transitions, 3887 flow
[2024-06-14 15:56:36,875 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3887, PETRI_PLACES=186, PETRI_TRANSITIONS=268}
[2024-06-14 15:56:36,875 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-14 15:56:36,875 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 268 transitions, 3887 flow
[2024-06-14 15:56:36,875 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:36,875 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:36,876 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 15:56:36,876 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 15:56:36,876 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:36,876 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:36,876 INFO  L85        PathProgramCache]: Analyzing trace with hash 1475233200, now seen corresponding path program 2 times
[2024-06-14 15:56:36,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:36,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088953849]
[2024-06-14 15:56:36,877 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:36,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:36,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:44,013 INFO  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 15:56:44,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:44,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088953849]
[2024-06-14 15:56:44,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088953849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:44,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:44,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:44,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901067775]
[2024-06-14 15:56:44,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:44,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:44,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:44,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:44,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:44,139 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:44,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 268 transitions, 3887 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:44,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:44,140 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:44,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:45,717 INFO  L124   PetriNetUnfolderBase]: 2807/4274 cut-off events.
[2024-06-14 15:56:45,718 INFO  L125   PetriNetUnfolderBase]: For 179356/179387 co-relation queries the response was YES.
[2024-06-14 15:56:45,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32335 conditions, 4274 events. 2807/4274 cut-off events. For 179356/179387 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21900 event pairs, 566 based on Foata normal form. 36/4304 useless extension candidates. Maximal degree in co-relation 32242. Up to 3413 conditions per place. 
[2024-06-14 15:56:45,753 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 169 selfloop transitions, 128 changer transitions 0/300 dead transitions.
[2024-06-14 15:56:45,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 300 transitions, 4661 flow
[2024-06-14 15:56:45,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:45,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:45,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 15:56:45,756 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-14 15:56:45,756 INFO  L175             Difference]: Start difference. First operand has 186 places, 268 transitions, 3887 flow. Second operand 8 states and 142 transitions.
[2024-06-14 15:56:45,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 300 transitions, 4661 flow
[2024-06-14 15:56:45,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 300 transitions, 4470 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-14 15:56:45,931 INFO  L231             Difference]: Finished difference. Result has 190 places, 270 transitions, 4021 flow
[2024-06-14 15:56:45,931 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3696, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4021, PETRI_PLACES=190, PETRI_TRANSITIONS=270}
[2024-06-14 15:56:45,932 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places.
[2024-06-14 15:56:45,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 270 transitions, 4021 flow
[2024-06-14 15:56:45,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:45,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:45,933 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 15:56:45,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 15:56:45,933 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:45,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:45,933 INFO  L85        PathProgramCache]: Analyzing trace with hash 1469518908, now seen corresponding path program 4 times
[2024-06-14 15:56:45,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:45,933 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515893448]
[2024-06-14 15:56:45,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:45,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:45,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:52,970 INFO  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 15:56:52,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:52,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515893448]
[2024-06-14 15:56:52,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515893448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:52,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:52,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:56:52,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977450751]
[2024-06-14 15:56:52,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:52,972 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:56:52,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:52,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:56:52,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:56:53,199 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:53,200 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 270 transitions, 4021 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:53,200 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:53,200 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:53,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:54,730 INFO  L124   PetriNetUnfolderBase]: 2799/4262 cut-off events.
[2024-06-14 15:56:54,730 INFO  L125   PetriNetUnfolderBase]: For 172965/172996 co-relation queries the response was YES.
[2024-06-14 15:56:54,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32653 conditions, 4262 events. 2799/4262 cut-off events. For 172965/172996 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21855 event pairs, 564 based on Foata normal form. 16/4272 useless extension candidates. Maximal degree in co-relation 32558. Up to 3521 conditions per place. 
[2024-06-14 15:56:54,771 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 176 selfloop transitions, 119 changer transitions 0/298 dead transitions.
[2024-06-14 15:56:54,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 298 transitions, 4771 flow
[2024-06-14 15:56:54,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:56:54,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:56:54,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-14 15:56:54,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 15:56:54,774 INFO  L175             Difference]: Start difference. First operand has 190 places, 270 transitions, 4021 flow. Second operand 8 states and 136 transitions.
[2024-06-14 15:56:54,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 298 transitions, 4771 flow
[2024-06-14 15:56:54,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 298 transitions, 4478 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-14 15:56:55,002 INFO  L231             Difference]: Finished difference. Result has 192 places, 272 transitions, 4037 flow
[2024-06-14 15:56:55,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4037, PETRI_PLACES=192, PETRI_TRANSITIONS=272}
[2024-06-14 15:56:55,003 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places.
[2024-06-14 15:56:55,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 272 transitions, 4037 flow
[2024-06-14 15:56:55,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:55,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:55,004 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 15:56:55,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 15:56:55,005 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:55,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:55,005 INFO  L85        PathProgramCache]: Analyzing trace with hash 662514652, now seen corresponding path program 5 times
[2024-06-14 15:56:55,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:55,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351750271]
[2024-06-14 15:56:55,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:55,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:55,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:01,979 INFO  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 15:57:01,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:01,980 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351750271]
[2024-06-14 15:57:01,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351750271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:01,980 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:01,980 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:57:01,980 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311791333]
[2024-06-14 15:57:01,980 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:01,980 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:57:01,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:01,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:57:01,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:57:02,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:02,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 272 transitions, 4037 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:02,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:02,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:02,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:03,729 INFO  L124   PetriNetUnfolderBase]: 2791/4250 cut-off events.
[2024-06-14 15:57:03,729 INFO  L125   PetriNetUnfolderBase]: For 174605/174636 co-relation queries the response was YES.
[2024-06-14 15:57:03,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32321 conditions, 4250 events. 2791/4250 cut-off events. For 174605/174636 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21733 event pairs, 562 based on Foata normal form. 16/4260 useless extension candidates. Maximal degree in co-relation 32225. Up to 3120 conditions per place. 
[2024-06-14 15:57:03,775 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 173 selfloop transitions, 128 changer transitions 0/304 dead transitions.
[2024-06-14 15:57:03,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 304 transitions, 4821 flow
[2024-06-14 15:57:03,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:57:03,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:57:03,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-14 15:57:03,776 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-14 15:57:03,776 INFO  L175             Difference]: Start difference. First operand has 192 places, 272 transitions, 4037 flow. Second operand 8 states and 140 transitions.
[2024-06-14 15:57:03,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 304 transitions, 4821 flow
[2024-06-14 15:57:04,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 304 transitions, 4532 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-14 15:57:04,074 INFO  L231             Difference]: Finished difference. Result has 194 places, 274 transitions, 4078 flow
[2024-06-14 15:57:04,075 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3748, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4078, PETRI_PLACES=194, PETRI_TRANSITIONS=274}
[2024-06-14 15:57:04,075 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-14 15:57:04,075 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 274 transitions, 4078 flow
[2024-06-14 15:57:04,075 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:04,075 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:04,076 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 15:57:04,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 15:57:04,076 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 15:57:04,076 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:04,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -272161416, now seen corresponding path program 1 times
[2024-06-14 15:57:04,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:04,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700313158]
[2024-06-14 15:57:04,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:04,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:04,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:14,683 INFO  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 15:57:14,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:14,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700313158]
[2024-06-14 15:57:14,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700313158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:14,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:14,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:14,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757299888]
[2024-06-14 15:57:14,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:14,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:14,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:14,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:14,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:14,756 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:14,756 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 274 transitions, 4078 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:14,756 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:14,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:14,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:16,340 INFO  L124   PetriNetUnfolderBase]: 2801/4259 cut-off events.
[2024-06-14 15:57:16,340 INFO  L125   PetriNetUnfolderBase]: For 180033/180041 co-relation queries the response was YES.
[2024-06-14 15:57:16,363 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32722 conditions, 4259 events. 2801/4259 cut-off events. For 180033/180041 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21837 event pairs, 594 based on Foata normal form. 10/4267 useless extension candidates. Maximal degree in co-relation 32625. Up to 4167 conditions per place. 
[2024-06-14 15:57:16,379 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 260 selfloop transitions, 35 changer transitions 0/298 dead transitions.
[2024-06-14 15:57:16,379 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 298 transitions, 4910 flow
[2024-06-14 15:57:16,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:16,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:16,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-14 15:57:16,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-14 15:57:16,381 INFO  L175             Difference]: Start difference. First operand has 194 places, 274 transitions, 4078 flow. Second operand 7 states and 114 transitions.
[2024-06-14 15:57:16,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 298 transitions, 4910 flow
[2024-06-14 15:57:16,605 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 298 transitions, 4602 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-14 15:57:16,610 INFO  L231             Difference]: Finished difference. Result has 195 places, 280 transitions, 3952 flow
[2024-06-14 15:57:16,611 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3770, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3952, PETRI_PLACES=195, PETRI_TRANSITIONS=280}
[2024-06-14 15:57:16,612 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places.
[2024-06-14 15:57:16,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 280 transitions, 3952 flow
[2024-06-14 15:57:16,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:16,613 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:16,615 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 15:57:16,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:57:16,615 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 15:57:16,616 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:16,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101461564, now seen corresponding path program 2 times
[2024-06-14 15:57:16,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:16,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582032132]
[2024-06-14 15:57:16,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:16,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:16,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:27,433 INFO  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 15:57:27,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:27,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582032132]
[2024-06-14 15:57:27,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582032132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:27,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:27,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:27,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533765231]
[2024-06-14 15:57:27,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:27,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:27,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:27,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:27,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:27,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:27,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 280 transitions, 3952 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:27,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:27,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:27,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:28,990 INFO  L124   PetriNetUnfolderBase]: 2795/4252 cut-off events.
[2024-06-14 15:57:28,990 INFO  L125   PetriNetUnfolderBase]: For 184356/184356 co-relation queries the response was YES.
[2024-06-14 15:57:29,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32392 conditions, 4252 events. 2795/4252 cut-off events. For 184356/184356 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21771 event pairs, 575 based on Foata normal form. 2/4252 useless extension candidates. Maximal degree in co-relation 32294. Up to 4054 conditions per place. 
[2024-06-14 15:57:29,025 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 233 selfloop transitions, 62 changer transitions 0/298 dead transitions.
[2024-06-14 15:57:29,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 298 transitions, 4686 flow
[2024-06-14 15:57:29,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:29,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:29,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-14 15:57:29,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-14 15:57:29,027 INFO  L175             Difference]: Start difference. First operand has 195 places, 280 transitions, 3952 flow. Second operand 7 states and 114 transitions.
[2024-06-14 15:57:29,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 298 transitions, 4686 flow
[2024-06-14 15:57:29,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 298 transitions, 4625 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-14 15:57:29,181 INFO  L231             Difference]: Finished difference. Result has 199 places, 280 transitions, 4021 flow
[2024-06-14 15:57:29,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4021, PETRI_PLACES=199, PETRI_TRANSITIONS=280}
[2024-06-14 15:57:29,181 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places.
[2024-06-14 15:57:29,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 280 transitions, 4021 flow
[2024-06-14 15:57:29,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:29,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:29,182 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 15:57:29,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:57:29,182 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:29,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:29,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -494334622, now seen corresponding path program 3 times
[2024-06-14 15:57:29,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:29,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730787891]
[2024-06-14 15:57:29,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:29,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:29,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:36,166 INFO  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 15:57:36,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:36,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730787891]
[2024-06-14 15:57:36,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730787891] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:36,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:36,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:57:36,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941738949]
[2024-06-14 15:57:36,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:36,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:57:36,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:36,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:57:36,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:57:36,344 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:36,345 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 280 transitions, 4021 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:36,345 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:36,345 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:36,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:37,876 INFO  L124   PetriNetUnfolderBase]: 2914/4457 cut-off events.
[2024-06-14 15:57:37,876 INFO  L125   PetriNetUnfolderBase]: For 217327/217358 co-relation queries the response was YES.
[2024-06-14 15:57:37,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34384 conditions, 4457 events. 2914/4457 cut-off events. For 217327/217358 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23188 event pairs, 534 based on Foata normal form. 28/4479 useless extension candidates. Maximal degree in co-relation 34284. Up to 2496 conditions per place. 
[2024-06-14 15:57:37,921 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 191 selfloop transitions, 123 changer transitions 0/317 dead transitions.
[2024-06-14 15:57:37,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 317 transitions, 5021 flow
[2024-06-14 15:57:37,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:57:37,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:57:37,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 15:57:37,924 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-14 15:57:37,924 INFO  L175             Difference]: Start difference. First operand has 199 places, 280 transitions, 4021 flow. Second operand 8 states and 143 transitions.
[2024-06-14 15:57:37,924 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 317 transitions, 5021 flow
[2024-06-14 15:57:38,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 317 transitions, 4923 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 15:57:38,142 INFO  L231             Difference]: Finished difference. Result has 203 places, 282 transitions, 4261 flow
[2024-06-14 15:57:38,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3923, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4261, PETRI_PLACES=203, PETRI_TRANSITIONS=282}
[2024-06-14 15:57:38,143 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places.
[2024-06-14 15:57:38,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 282 transitions, 4261 flow
[2024-06-14 15:57:38,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:38,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:38,143 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 15:57:38,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:57:38,144 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:38,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:38,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -503531392, now seen corresponding path program 4 times
[2024-06-14 15:57:38,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:38,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859793955]
[2024-06-14 15:57:38,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:38,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:38,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:44,796 INFO  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 15:57:44,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:44,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859793955]
[2024-06-14 15:57:44,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859793955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:44,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:44,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:57:44,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734721012]
[2024-06-14 15:57:44,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:44,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:57:44,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:44,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:57:44,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:57:44,921 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:44,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 282 transitions, 4261 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:44,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:44,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:44,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:46,558 INFO  L124   PetriNetUnfolderBase]: 3033/4658 cut-off events.
[2024-06-14 15:57:46,558 INFO  L125   PetriNetUnfolderBase]: For 244032/244063 co-relation queries the response was YES.
[2024-06-14 15:57:46,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36769 conditions, 4658 events. 3033/4658 cut-off events. For 244032/244063 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24730 event pairs, 634 based on Foata normal form. 28/4680 useless extension candidates. Maximal degree in co-relation 36668. Up to 3465 conditions per place. 
[2024-06-14 15:57:46,685 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 201 selfloop transitions, 115 changer transitions 0/319 dead transitions.
[2024-06-14 15:57:46,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 319 transitions, 5275 flow
[2024-06-14 15:57:46,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:57:46,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:57:46,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 15:57:46,688 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-14 15:57:46,688 INFO  L175             Difference]: Start difference. First operand has 203 places, 282 transitions, 4261 flow. Second operand 8 states and 146 transitions.
[2024-06-14 15:57:46,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 319 transitions, 5275 flow
[2024-06-14 15:57:46,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 319 transitions, 5111 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-14 15:57:46,970 INFO  L231             Difference]: Finished difference. Result has 207 places, 284 transitions, 4424 flow
[2024-06-14 15:57:46,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4101, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4424, PETRI_PLACES=207, PETRI_TRANSITIONS=284}
[2024-06-14 15:57:46,972 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places.
[2024-06-14 15:57:46,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 284 transitions, 4424 flow
[2024-06-14 15:57:46,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:46,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:46,972 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 15:57:46,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:57:46,972 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:46,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:46,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -760241152, now seen corresponding path program 5 times
[2024-06-14 15:57:46,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:46,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911972162]
[2024-06-14 15:57:46,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:46,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:47,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:54,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 15:57:54,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:54,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911972162]
[2024-06-14 15:57:54,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911972162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:54,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:54,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:57:54,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602715176]
[2024-06-14 15:57:54,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:54,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:57:54,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:54,231 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:57:54,231 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:57:54,452 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:57:54,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 284 transitions, 4424 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:54,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:54,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:57:54,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:56,279 INFO  L124   PetriNetUnfolderBase]: 3058/4705 cut-off events.
[2024-06-14 15:57:56,280 INFO  L125   PetriNetUnfolderBase]: For 249957/249988 co-relation queries the response was YES.
[2024-06-14 15:57:56,310 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37133 conditions, 4705 events. 3058/4705 cut-off events. For 249957/249988 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25077 event pairs, 650 based on Foata normal form. 32/4731 useless extension candidates. Maximal degree in co-relation 37030. Up to 3706 conditions per place. 
[2024-06-14 15:57:56,329 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 201 selfloop transitions, 115 changer transitions 0/319 dead transitions.
[2024-06-14 15:57:56,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 319 transitions, 5240 flow
[2024-06-14 15:57:56,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:57:56,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:57:56,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-14 15:57:56,340 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-14 15:57:56,340 INFO  L175             Difference]: Start difference. First operand has 207 places, 284 transitions, 4424 flow. Second operand 9 states and 157 transitions.
[2024-06-14 15:57:56,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 319 transitions, 5240 flow
[2024-06-14 15:57:56,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 319 transitions, 5075 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-14 15:57:56,701 INFO  L231             Difference]: Finished difference. Result has 212 places, 285 transitions, 4548 flow
[2024-06-14 15:57:56,701 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4548, PETRI_PLACES=212, PETRI_TRANSITIONS=285}
[2024-06-14 15:57:56,701 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-14 15:57:56,702 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 4548 flow
[2024-06-14 15:57:56,702 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:56,702 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:56,702 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 15:57:56,702 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:57:56,702 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 15:57:56,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:56,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 824667898, now seen corresponding path program 3 times
[2024-06-14 15:57:56,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:56,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304706049]
[2024-06-14 15:57:56,703 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:56,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:56,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:07,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:07,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:07,175 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304706049]
[2024-06-14 15:58:07,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304706049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:07,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:07,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:58:07,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708611938]
[2024-06-14 15:58:07,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:07,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:58:07,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:07,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:58:07,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:58:07,334 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:07,334 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 4548 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:07,334 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:07,334 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:07,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:08,889 INFO  L124   PetriNetUnfolderBase]: 3025/4659 cut-off events.
[2024-06-14 15:58:08,889 INFO  L125   PetriNetUnfolderBase]: For 239309/239317 co-relation queries the response was YES.
[2024-06-14 15:58:08,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37043 conditions, 4659 events. 3025/4659 cut-off events. For 239309/239317 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24903 event pairs, 666 based on Foata normal form. 15/4672 useless extension candidates. Maximal degree in co-relation 36938. Up to 4465 conditions per place. 
[2024-06-14 15:58:08,934 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 234 selfloop transitions, 69 changer transitions 0/306 dead transitions.
[2024-06-14 15:58:08,934 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 306 transitions, 5236 flow
[2024-06-14 15:58:08,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:58:08,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:58:08,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 15:58:08,936 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-14 15:58:08,936 INFO  L175             Difference]: Start difference. First operand has 212 places, 285 transitions, 4548 flow. Second operand 6 states and 111 transitions.
[2024-06-14 15:58:08,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 306 transitions, 5236 flow
[2024-06-14 15:58:09,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 306 transitions, 4941 flow, removed 33 selfloop flow, removed 8 redundant places.
[2024-06-14 15:58:09,253 INFO  L231             Difference]: Finished difference. Result has 210 places, 285 transitions, 4440 flow
[2024-06-14 15:58:09,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4253, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4440, PETRI_PLACES=210, PETRI_TRANSITIONS=285}
[2024-06-14 15:58:09,254 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places.
[2024-06-14 15:58:09,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 285 transitions, 4440 flow
[2024-06-14 15:58:09,254 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:09,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:09,254 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 15:58:09,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:58:09,255 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 15:58:09,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:09,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 2071421620, now seen corresponding path program 2 times
[2024-06-14 15:58:09,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:09,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730419592]
[2024-06-14 15:58:09,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:09,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:09,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:19,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:19,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:19,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730419592]
[2024-06-14 15:58:19,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730419592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:19,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:19,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:58:19,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863978210]
[2024-06-14 15:58:19,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:19,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:58:19,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:19,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:58:19,705 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:58:19,853 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:19,854 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 285 transitions, 4440 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:19,854 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:19,854 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:19,854 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:21,401 INFO  L124   PetriNetUnfolderBase]: 3019/4646 cut-off events.
[2024-06-14 15:58:21,402 INFO  L125   PetriNetUnfolderBase]: For 236833/236841 co-relation queries the response was YES.
[2024-06-14 15:58:21,435 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36612 conditions, 4646 events. 3019/4646 cut-off events. For 236833/236841 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 24818 event pairs, 688 based on Foata normal form. 10/4654 useless extension candidates. Maximal degree in co-relation 36507. Up to 4570 conditions per place. 
[2024-06-14 15:58:21,454 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 267 selfloop transitions, 30 changer transitions 0/300 dead transitions.
[2024-06-14 15:58:21,455 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 300 transitions, 5092 flow
[2024-06-14 15:58:21,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:58:21,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:58:21,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 15:58:21,456 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 15:58:21,456 INFO  L175             Difference]: Start difference. First operand has 210 places, 285 transitions, 4440 flow. Second operand 6 states and 102 transitions.
[2024-06-14 15:58:21,457 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 300 transitions, 5092 flow
[2024-06-14 15:58:21,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 300 transitions, 4971 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-14 15:58:21,861 INFO  L231             Difference]: Finished difference. Result has 212 places, 285 transitions, 4385 flow
[2024-06-14 15:58:21,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4319, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4385, PETRI_PLACES=212, PETRI_TRANSITIONS=285}
[2024-06-14 15:58:21,861 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-14 15:58:21,861 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 4385 flow
[2024-06-14 15:58:21,861 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:21,861 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:21,861 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 15:58:21,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:58:21,862 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 15:58:21,862 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:21,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -846974204, now seen corresponding path program 1 times
[2024-06-14 15:58:21,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:21,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473005190]
[2024-06-14 15:58:21,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:21,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:21,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:30,453 INFO  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 15:58:30,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:30,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473005190]
[2024-06-14 15:58:30,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473005190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:30,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:30,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:30,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39286841]
[2024-06-14 15:58:30,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:30,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:30,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:30,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:30,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:30,597 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:30,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 4385 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:30,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:30,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:30,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:32,074 INFO  L124   PetriNetUnfolderBase]: 3037/4671 cut-off events.
[2024-06-14 15:58:32,074 INFO  L125   PetriNetUnfolderBase]: For 246858/246870 co-relation queries the response was YES.
[2024-06-14 15:58:32,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36916 conditions, 4671 events. 3037/4671 cut-off events. For 246858/246870 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24953 event pairs, 690 based on Foata normal form. 14/4682 useless extension candidates. Maximal degree in co-relation 36810. Up to 4480 conditions per place. 
[2024-06-14 15:58:32,120 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 269 selfloop transitions, 46 changer transitions 0/318 dead transitions.
[2024-06-14 15:58:32,121 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 318 transitions, 5499 flow
[2024-06-14 15:58:32,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:58:32,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:58:32,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-14 15:58:32,122 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-14 15:58:32,122 INFO  L175             Difference]: Start difference. First operand has 212 places, 285 transitions, 4385 flow. Second operand 7 states and 116 transitions.
[2024-06-14 15:58:32,122 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 318 transitions, 5499 flow
[2024-06-14 15:58:32,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 318 transitions, 5402 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-14 15:58:32,422 INFO  L231             Difference]: Finished difference. Result has 215 places, 300 transitions, 4673 flow
[2024-06-14 15:58:32,422 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4288, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4673, PETRI_PLACES=215, PETRI_TRANSITIONS=300}
[2024-06-14 15:58:32,423 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places.
[2024-06-14 15:58:32,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 300 transitions, 4673 flow
[2024-06-14 15:58:32,423 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:32,423 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:32,423 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 15:58:32,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:58:32,423 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 15:58:32,424 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:32,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -846854234, now seen corresponding path program 2 times
[2024-06-14 15:58:32,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:32,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645721094]
[2024-06-14 15:58:32,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:32,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:32,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:39,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:39,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:39,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645721094]
[2024-06-14 15:58:39,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645721094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:39,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:39,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:58:39,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169035383]
[2024-06-14 15:58:39,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:39,871 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:58:39,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:39,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:58:39,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:58:39,999 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:39,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 300 transitions, 4673 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:39,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:39,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:39,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:41,664 INFO  L124   PetriNetUnfolderBase]: 3141/4821 cut-off events.
[2024-06-14 15:58:41,665 INFO  L125   PetriNetUnfolderBase]: For 270152/270152 co-relation queries the response was YES.
[2024-06-14 15:58:41,696 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39172 conditions, 4821 events. 3141/4821 cut-off events. For 270152/270152 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25795 event pairs, 740 based on Foata normal form. 6/4825 useless extension candidates. Maximal degree in co-relation 39064. Up to 4698 conditions per place. 
[2024-06-14 15:58:41,715 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 306 selfloop transitions, 37 changer transitions 0/346 dead transitions.
[2024-06-14 15:58:41,715 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 346 transitions, 5964 flow
[2024-06-14 15:58:41,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:58:41,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:58:41,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 15:58:41,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:58:41,716 INFO  L175             Difference]: Start difference. First operand has 215 places, 300 transitions, 4673 flow. Second operand 8 states and 128 transitions.
[2024-06-14 15:58:41,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 346 transitions, 5964 flow
[2024-06-14 15:58:42,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 346 transitions, 5809 flow, removed 69 selfloop flow, removed 2 redundant places.
[2024-06-14 15:58:42,057 INFO  L231             Difference]: Finished difference. Result has 223 places, 326 transitions, 5091 flow
[2024-06-14 15:58:42,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5091, PETRI_PLACES=223, PETRI_TRANSITIONS=326}
[2024-06-14 15:58:42,057 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places.
[2024-06-14 15:58:42,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 326 transitions, 5091 flow
[2024-06-14 15:58:42,058 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:42,058 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:42,058 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 15:58:42,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:58:42,058 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 15:58:42,059 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:42,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043900316, now seen corresponding path program 3 times
[2024-06-14 15:58:42,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:42,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298602678]
[2024-06-14 15:58:42,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:42,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:42,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:49,687 INFO  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 15:58:49,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:49,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298602678]
[2024-06-14 15:58:49,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298602678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:49,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:49,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:58:49,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016468635]
[2024-06-14 15:58:49,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:49,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:58:49,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:49,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:58:49,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:58:49,895 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:58:49,896 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 326 transitions, 5091 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:49,896 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:49,896 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:58:49,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:51,511 INFO  L124   PetriNetUnfolderBase]: 3232/4943 cut-off events.
[2024-06-14 15:58:51,511 INFO  L125   PetriNetUnfolderBase]: For 288463/288471 co-relation queries the response was YES.
[2024-06-14 15:58:51,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41282 conditions, 4943 events. 3232/4943 cut-off events. For 288463/288471 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26468 event pairs, 705 based on Foata normal form. 14/4955 useless extension candidates. Maximal degree in co-relation 41170. Up to 4721 conditions per place. 
[2024-06-14 15:58:51,564 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 301 selfloop transitions, 68 changer transitions 0/372 dead transitions.
[2024-06-14 15:58:51,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 372 transitions, 6418 flow
[2024-06-14 15:58:51,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:58:51,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:58:51,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 15:58:51,565 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:58:51,565 INFO  L175             Difference]: Start difference. First operand has 223 places, 326 transitions, 5091 flow. Second operand 7 states and 126 transitions.
[2024-06-14 15:58:51,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 372 transitions, 6418 flow
[2024-06-14 15:58:51,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 372 transitions, 6260 flow, removed 78 selfloop flow, removed 1 redundant places.
[2024-06-14 15:58:51,980 INFO  L231             Difference]: Finished difference. Result has 231 places, 348 transitions, 5588 flow
[2024-06-14 15:58:51,980 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4933, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5588, PETRI_PLACES=231, PETRI_TRANSITIONS=348}
[2024-06-14 15:58:51,981 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places.
[2024-06-14 15:58:51,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 348 transitions, 5588 flow
[2024-06-14 15:58:51,981 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:51,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:51,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:51,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:58:51,981 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 15:58:51,982 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:51,982 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044146580, now seen corresponding path program 1 times
[2024-06-14 15:58:51,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:51,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219278842]
[2024-06-14 15:58:51,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:51,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:52,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:01,771 INFO  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 15:59:01,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:01,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219278842]
[2024-06-14 15:59:01,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219278842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:01,772 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:01,772 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:01,772 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264322343]
[2024-06-14 15:59:01,772 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:01,773 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:01,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:01,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:01,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:01,908 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:01,913 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 348 transitions, 5588 flow. Second operand  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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 15:59:01,914 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:01,914 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:01,914 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:03,510 INFO  L124   PetriNetUnfolderBase]: 3227/4941 cut-off events.
[2024-06-14 15:59:03,510 INFO  L125   PetriNetUnfolderBase]: For 296488/296488 co-relation queries the response was YES.
[2024-06-14 15:59:03,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41885 conditions, 4941 events. 3227/4941 cut-off events. For 296488/296488 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26373 event pairs, 762 based on Foata normal form. 2/4941 useless extension candidates. Maximal degree in co-relation 41768. Up to 4894 conditions per place. 
[2024-06-14 15:59:03,662 INFO  L140   encePairwiseOnDemand]: 35/41 looper letters, 341 selfloop transitions, 14 changer transitions 0/358 dead transitions.
[2024-06-14 15:59:03,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 358 transitions, 6362 flow
[2024-06-14 15:59:03,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:59:03,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:59:03,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2024-06-14 15:59:03,663 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-14 15:59:03,663 INFO  L175             Difference]: Start difference. First operand has 231 places, 348 transitions, 5588 flow. Second operand 5 states and 81 transitions.
[2024-06-14 15:59:03,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 358 transitions, 6362 flow
[2024-06-14 15:59:04,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 358 transitions, 6215 flow, removed 68 selfloop flow, removed 2 redundant places.
[2024-06-14 15:59:04,167 INFO  L231             Difference]: Finished difference. Result has 234 places, 350 transitions, 5516 flow
[2024-06-14 15:59:04,167 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5441, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5516, PETRI_PLACES=234, PETRI_TRANSITIONS=350}
[2024-06-14 15:59:04,168 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places.
[2024-06-14 15:59:04,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 5516 flow
[2024-06-14 15:59:04,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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 15:59:04,168 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:04,169 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 15:59:04,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:59:04,169 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:04,169 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:04,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068627935, now seen corresponding path program 1 times
[2024-06-14 15:59:04,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:04,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025516173]
[2024-06-14 15:59:04,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:04,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:04,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:12,074 INFO  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 15:59:12,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:12,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025516173]
[2024-06-14 15:59:12,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025516173] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:12,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:12,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:59:12,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510990808]
[2024-06-14 15:59:12,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:12,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:59:12,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:12,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:59:12,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:59:12,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:12,188 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 5516 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:12,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:12,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:12,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:14,275 INFO  L124   PetriNetUnfolderBase]: 3207/4907 cut-off events.
[2024-06-14 15:59:14,276 INFO  L125   PetriNetUnfolderBase]: For 303655/303667 co-relation queries the response was YES.
[2024-06-14 15:59:14,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41180 conditions, 4907 events. 3207/4907 cut-off events. For 303655/303667 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26096 event pairs, 502 based on Foata normal form. 24/4928 useless extension candidates. Maximal degree in co-relation 41061. Up to 4542 conditions per place. 
[2024-06-14 15:59:14,329 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 326 selfloop transitions, 55 changer transitions 0/384 dead transitions.
[2024-06-14 15:59:14,330 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 384 transitions, 6402 flow
[2024-06-14 15:59:14,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:14,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:14,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-14 15:59:14,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:59:14,333 INFO  L175             Difference]: Start difference. First operand has 234 places, 350 transitions, 5516 flow. Second operand 9 states and 144 transitions.
[2024-06-14 15:59:14,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 384 transitions, 6402 flow
[2024-06-14 15:59:14,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 384 transitions, 6343 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-14 15:59:14,739 INFO  L231             Difference]: Finished difference. Result has 240 places, 350 transitions, 5573 flow
[2024-06-14 15:59:14,740 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5457, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5573, PETRI_PLACES=240, PETRI_TRANSITIONS=350}
[2024-06-14 15:59:14,740 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places.
[2024-06-14 15:59:14,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 350 transitions, 5573 flow
[2024-06-14 15:59:14,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:14,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:14,741 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 15:59:14,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:59:14,741 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:14,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:14,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -10979679, now seen corresponding path program 2 times
[2024-06-14 15:59:14,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:14,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545369050]
[2024-06-14 15:59:14,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:14,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:14,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:22,960 INFO  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 15:59:22,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:22,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545369050]
[2024-06-14 15:59:22,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545369050] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:22,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:22,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:59:22,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773213073]
[2024-06-14 15:59:22,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:22,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:59:22,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:22,961 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:59:22,961 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:59:23,154 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:23,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 350 transitions, 5573 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:23,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:23,155 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:23,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:25,155 INFO  L124   PetriNetUnfolderBase]: 3248/4976 cut-off events.
[2024-06-14 15:59:25,156 INFO  L125   PetriNetUnfolderBase]: For 316503/316545 co-relation queries the response was YES.
[2024-06-14 15:59:25,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41983 conditions, 4976 events. 3248/4976 cut-off events. For 316503/316545 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26698 event pairs, 650 based on Foata normal form. 44/5016 useless extension candidates. Maximal degree in co-relation 41863. Up to 4465 conditions per place. 
[2024-06-14 15:59:25,213 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 77 changer transitions 0/385 dead transitions.
[2024-06-14 15:59:25,213 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 385 transitions, 6507 flow
[2024-06-14 15:59:25,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:25,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:25,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-14 15:59:25,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-14 15:59:25,216 INFO  L175             Difference]: Start difference. First operand has 240 places, 350 transitions, 5573 flow. Second operand 9 states and 147 transitions.
[2024-06-14 15:59:25,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 385 transitions, 6507 flow
[2024-06-14 15:59:25,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 385 transitions, 6284 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-14 15:59:25,713 INFO  L231             Difference]: Finished difference. Result has 241 places, 351 transitions, 5556 flow
[2024-06-14 15:59:25,713 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5351, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5556, PETRI_PLACES=241, PETRI_TRANSITIONS=351}
[2024-06-14 15:59:25,714 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places.
[2024-06-14 15:59:25,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 351 transitions, 5556 flow
[2024-06-14 15:59:25,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:25,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:25,714 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:25,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:59:25,714 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:25,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:25,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 792304123, now seen corresponding path program 3 times
[2024-06-14 15:59:25,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:25,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402952641]
[2024-06-14 15:59:25,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:25,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:25,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:33,421 INFO  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 15:59:33,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:33,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402952641]
[2024-06-14 15:59:33,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402952641] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:33,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:33,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:33,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603364753]
[2024-06-14 15:59:33,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:33,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:33,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:33,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:33,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:33,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:33,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 351 transitions, 5556 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:33,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:33,572 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:33,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:35,378 INFO  L124   PetriNetUnfolderBase]: 3228/4948 cut-off events.
[2024-06-14 15:59:35,378 INFO  L125   PetriNetUnfolderBase]: For 318423/318455 co-relation queries the response was YES.
[2024-06-14 15:59:35,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40946 conditions, 4948 events. 3228/4948 cut-off events. For 318423/318455 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26443 event pairs, 635 based on Foata normal form. 23/4965 useless extension candidates. Maximal degree in co-relation 40826. Up to 4225 conditions per place. 
[2024-06-14 15:59:35,431 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 118 changer transitions 0/380 dead transitions.
[2024-06-14 15:59:35,431 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 380 transitions, 6431 flow
[2024-06-14 15:59:35,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:59:35,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:59:35,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-14 15:59:35,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4115853658536585
[2024-06-14 15:59:35,434 INFO  L175             Difference]: Start difference. First operand has 241 places, 351 transitions, 5556 flow. Second operand 8 states and 135 transitions.
[2024-06-14 15:59:35,434 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 380 transitions, 6431 flow
[2024-06-14 15:59:35,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 380 transitions, 6221 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-14 15:59:35,934 INFO  L231             Difference]: Finished difference. Result has 243 places, 352 transitions, 5617 flow
[2024-06-14 15:59:35,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5346, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5617, PETRI_PLACES=243, PETRI_TRANSITIONS=352}
[2024-06-14 15:59:35,934 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places.
[2024-06-14 15:59:35,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 352 transitions, 5617 flow
[2024-06-14 15:59:35,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:35,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:35,935 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 15:59:35,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:59:35,935 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 15:59:35,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:35,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 201455432, now seen corresponding path program 1 times
[2024-06-14 15:59:35,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:35,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717984096]
[2024-06-14 15:59:35,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:35,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:35,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:46,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:46,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:46,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717984096]
[2024-06-14 15:59:46,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717984096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:46,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:46,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:46,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762270156]
[2024-06-14 15:59:46,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:46,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:46,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:46,870 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:46,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:46,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:46,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 352 transitions, 5617 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:46,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:46,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:46,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:48,954 INFO  L124   PetriNetUnfolderBase]: 3248/4976 cut-off events.
[2024-06-14 15:59:48,955 INFO  L125   PetriNetUnfolderBase]: For 316735/316743 co-relation queries the response was YES.
[2024-06-14 15:59:48,987 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41319 conditions, 4976 events. 3248/4976 cut-off events. For 316735/316743 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26726 event pairs, 670 based on Foata normal form. 12/4986 useless extension candidates. Maximal degree in co-relation 41197. Up to 4677 conditions per place. 
[2024-06-14 15:59:49,006 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 296 selfloop transitions, 86 changer transitions 0/385 dead transitions.
[2024-06-14 15:59:49,007 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 385 transitions, 6691 flow
[2024-06-14 15:59:49,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:59:49,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:59:49,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-14 15:59:49,009 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4176829268292683
[2024-06-14 15:59:49,009 INFO  L175             Difference]: Start difference. First operand has 243 places, 352 transitions, 5617 flow. Second operand 8 states and 137 transitions.
[2024-06-14 15:59:49,009 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 385 transitions, 6691 flow
[2024-06-14 15:59:49,460 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 385 transitions, 6431 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-14 15:59:49,465 INFO  L231             Difference]: Finished difference. Result has 245 places, 358 transitions, 5641 flow
[2024-06-14 15:59:49,466 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5357, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5641, PETRI_PLACES=245, PETRI_TRANSITIONS=358}
[2024-06-14 15:59:49,466 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places.
[2024-06-14 15:59:49,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 358 transitions, 5641 flow
[2024-06-14 15:59:49,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:49,466 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:49,467 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:49,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:59:49,467 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:49,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:49,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -726508483, now seen corresponding path program 1 times
[2024-06-14 15:59:49,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:49,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236266160]
[2024-06-14 15:59:49,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:49,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:49,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:57,622 INFO  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 15:59:57,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:57,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236266160]
[2024-06-14 15:59:57,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236266160] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:57,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:57,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:57,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427155712]
[2024-06-14 15:59:57,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:57,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:57,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:57,623 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:57,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:57,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:59:57,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 358 transitions, 5641 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:57,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:57,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:59:57,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:59,492 INFO  L124   PetriNetUnfolderBase]: 3261/4989 cut-off events.
[2024-06-14 15:59:59,493 INFO  L125   PetriNetUnfolderBase]: For 323969/323977 co-relation queries the response was YES.
[2024-06-14 15:59:59,531 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41720 conditions, 4989 events. 3261/4989 cut-off events. For 323969/323977 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26709 event pairs, 688 based on Foata normal form. 9/4996 useless extension candidates. Maximal degree in co-relation 41597. Up to 4890 conditions per place. 
[2024-06-14 15:59:59,551 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 340 selfloop transitions, 41 changer transitions 0/384 dead transitions.
[2024-06-14 15:59:59,552 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 384 transitions, 6713 flow
[2024-06-14 15:59:59,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:59:59,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:59:59,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions.
[2024-06-14 15:59:59,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3604336043360434
[2024-06-14 15:59:59,553 INFO  L175             Difference]: Start difference. First operand has 245 places, 358 transitions, 5641 flow. Second operand 9 states and 133 transitions.
[2024-06-14 15:59:59,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 384 transitions, 6713 flow
[2024-06-14 16:00:00,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 384 transitions, 6605 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-14 16:00:00,161 INFO  L231             Difference]: Finished difference. Result has 250 places, 364 transitions, 5767 flow
[2024-06-14 16:00:00,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5533, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5767, PETRI_PLACES=250, PETRI_TRANSITIONS=364}
[2024-06-14 16:00:00,162 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places.
[2024-06-14 16:00:00,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 364 transitions, 5767 flow
[2024-06-14 16:00:00,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:00,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:00,163 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:00:00,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 16:00:00,163 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:00,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:00,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -720794563, now seen corresponding path program 2 times
[2024-06-14 16:00:00,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:00,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458018172]
[2024-06-14 16:00:00,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:00,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:00,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:08,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:08,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:08,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458018172]
[2024-06-14 16:00:08,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458018172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:08,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:08,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:08,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232705846]
[2024-06-14 16:00:08,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:08,085 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:08,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:08,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:08,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:08,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:08,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 364 transitions, 5767 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:08,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:08,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:08,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:09,887 INFO  L124   PetriNetUnfolderBase]: 3258/4985 cut-off events.
[2024-06-14 16:00:09,888 INFO  L125   PetriNetUnfolderBase]: For 332170/332178 co-relation queries the response was YES.
[2024-06-14 16:00:09,928 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41768 conditions, 4985 events. 3258/4985 cut-off events. For 332170/332178 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26741 event pairs, 689 based on Foata normal form. 9/4992 useless extension candidates. Maximal degree in co-relation 41643. Up to 4920 conditions per place. 
[2024-06-14 16:00:09,948 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 350 selfloop transitions, 25 changer transitions 0/378 dead transitions.
[2024-06-14 16:00:09,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 378 transitions, 6565 flow
[2024-06-14 16:00:09,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:00:09,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:00:09,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-14 16:00:09,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37630662020905925
[2024-06-14 16:00:09,950 INFO  L175             Difference]: Start difference. First operand has 250 places, 364 transitions, 5767 flow. Second operand 7 states and 108 transitions.
[2024-06-14 16:00:09,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 378 transitions, 6565 flow
[2024-06-14 16:00:10,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 378 transitions, 6444 flow, removed 51 selfloop flow, removed 3 redundant places.
[2024-06-14 16:00:10,521 INFO  L231             Difference]: Finished difference. Result has 254 places, 364 transitions, 5702 flow
[2024-06-14 16:00:10,522 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5702, PETRI_PLACES=254, PETRI_TRANSITIONS=364}
[2024-06-14 16:00:10,522 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-14 16:00:10,522 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 364 transitions, 5702 flow
[2024-06-14 16:00:10,522 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:10,522 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:10,523 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:00:10,523 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 16:00:10,523 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:00:10,525 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:10,525 INFO  L85        PathProgramCache]: Analyzing trace with hash -197424701, now seen corresponding path program 4 times
[2024-06-14 16:00:10,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:10,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377098351]
[2024-06-14 16:00:10,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:10,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:10,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:18,503 INFO  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:00:18,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:18,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377098351]
[2024-06-14 16:00:18,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377098351] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:18,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:18,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:00:18,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105326148]
[2024-06-14 16:00:18,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:18,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:00:18,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:18,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:00:18,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:00:18,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:18,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 364 transitions, 5702 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:18,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:18,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:18,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:20,547 INFO  L124   PetriNetUnfolderBase]: 3238/4957 cut-off events.
[2024-06-14 16:00:20,548 INFO  L125   PetriNetUnfolderBase]: For 343166/343168 co-relation queries the response was YES.
[2024-06-14 16:00:20,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41172 conditions, 4957 events. 3238/4957 cut-off events. For 343166/343168 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26491 event pairs, 623 based on Foata normal form. 14/4966 useless extension candidates. Maximal degree in co-relation 41045. Up to 4147 conditions per place. 
[2024-06-14 16:00:20,601 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 283 selfloop transitions, 112 changer transitions 0/398 dead transitions.
[2024-06-14 16:00:20,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 398 transitions, 6633 flow
[2024-06-14 16:00:20,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:00:20,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:00:20,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:00:20,617 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 16:00:20,617 INFO  L175             Difference]: Start difference. First operand has 254 places, 364 transitions, 5702 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:00:20,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 398 transitions, 6633 flow
[2024-06-14 16:00:21,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 398 transitions, 6571 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-14 16:00:21,286 INFO  L231             Difference]: Finished difference. Result has 259 places, 365 transitions, 5908 flow
[2024-06-14 16:00:21,286 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5640, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5908, PETRI_PLACES=259, PETRI_TRANSITIONS=365}
[2024-06-14 16:00:21,286 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-14 16:00:21,286 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 365 transitions, 5908 flow
[2024-06-14 16:00:21,287 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:21,287 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:21,287 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:00:21,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 16:00:21,287 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:21,287 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:21,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -633595960, now seen corresponding path program 2 times
[2024-06-14 16:00:21,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:21,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647806382]
[2024-06-14 16:00:21,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:21,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:21,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:32,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:32,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:32,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647806382]
[2024-06-14 16:00:32,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647806382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:32,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:32,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:32,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81799022]
[2024-06-14 16:00:32,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:32,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:32,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:32,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:32,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:33,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:33,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 365 transitions, 5908 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:33,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:33,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:33,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:35,099 INFO  L124   PetriNetUnfolderBase]: 3290/5026 cut-off events.
[2024-06-14 16:00:35,099 INFO  L125   PetriNetUnfolderBase]: For 353836/353836 co-relation queries the response was YES.
[2024-06-14 16:00:35,134 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42613 conditions, 5026 events. 3290/5026 cut-off events. For 353836/353836 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26836 event pairs, 653 based on Foata normal form. 4/5028 useless extension candidates. Maximal degree in co-relation 42484. Up to 4699 conditions per place. 
[2024-06-14 16:00:35,152 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 88 changer transitions 0/396 dead transitions.
[2024-06-14 16:00:35,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 396 transitions, 7108 flow
[2024-06-14 16:00:35,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:35,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:35,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-14 16:00:35,154 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 16:00:35,154 INFO  L175             Difference]: Start difference. First operand has 259 places, 365 transitions, 5908 flow. Second operand 8 states and 136 transitions.
[2024-06-14 16:00:35,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 396 transitions, 7108 flow
[2024-06-14 16:00:35,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 396 transitions, 6653 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-14 16:00:35,855 INFO  L231             Difference]: Finished difference. Result has 259 places, 371 transitions, 5727 flow
[2024-06-14 16:00:35,856 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5453, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5727, PETRI_PLACES=259, PETRI_TRANSITIONS=371}
[2024-06-14 16:00:35,856 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-14 16:00:35,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 371 transitions, 5727 flow
[2024-06-14 16:00:35,856 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:35,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:35,857 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:00:35,857 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 16:00:35,857 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:35,857 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:35,857 INFO  L85        PathProgramCache]: Analyzing trace with hash -1902230870, now seen corresponding path program 3 times
[2024-06-14 16:00:35,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:35,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121056156]
[2024-06-14 16:00:35,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:35,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:35,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:47,467 INFO  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:00:47,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:47,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121056156]
[2024-06-14 16:00:47,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121056156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:47,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:47,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:47,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076292859]
[2024-06-14 16:00:47,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:47,468 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:47,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:47,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:47,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:47,584 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:47,584 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 371 transitions, 5727 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:47,585 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:47,585 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:47,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:49,408 INFO  L124   PetriNetUnfolderBase]: 3278/5010 cut-off events.
[2024-06-14 16:00:49,409 INFO  L125   PetriNetUnfolderBase]: For 354276/354276 co-relation queries the response was YES.
[2024-06-14 16:00:49,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41162 conditions, 5010 events. 3278/5010 cut-off events. For 354276/354276 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26779 event pairs, 651 based on Foata normal form. 4/5012 useless extension candidates. Maximal degree in co-relation 41034. Up to 4691 conditions per place. 
[2024-06-14 16:00:49,464 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 302 selfloop transitions, 89 changer transitions 0/394 dead transitions.
[2024-06-14 16:00:49,464 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 394 transitions, 6713 flow
[2024-06-14 16:00:49,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:49,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:49,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-14 16:00:49,467 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-14 16:00:49,467 INFO  L175             Difference]: Start difference. First operand has 259 places, 371 transitions, 5727 flow. Second operand 8 states and 133 transitions.
[2024-06-14 16:00:49,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 394 transitions, 6713 flow
[2024-06-14 16:00:50,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 394 transitions, 6551 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-14 16:00:50,109 INFO  L231             Difference]: Finished difference. Result has 263 places, 371 transitions, 5749 flow
[2024-06-14 16:00:50,109 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5565, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5749, PETRI_PLACES=263, PETRI_TRANSITIONS=371}
[2024-06-14 16:00:50,109 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places.
[2024-06-14 16:00:50,109 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 371 transitions, 5749 flow
[2024-06-14 16:00:50,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:50,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:50,110 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:00:50,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:00:50,110 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:50,110 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:50,110 INFO  L85        PathProgramCache]: Analyzing trace with hash -483070665, now seen corresponding path program 3 times
[2024-06-14 16:00:50,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:50,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074568163]
[2024-06-14 16:00:50,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:50,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:50,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:58,329 INFO  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:00:58,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:58,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074568163]
[2024-06-14 16:00:58,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074568163] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:58,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:58,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:58,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84406654]
[2024-06-14 16:00:58,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:58,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:58,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:58,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:58,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:58,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:00:58,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 371 transitions, 5749 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:58,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:58,482 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:00:58,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:00,159 INFO  L124   PetriNetUnfolderBase]: 3280/5012 cut-off events.
[2024-06-14 16:01:00,160 INFO  L125   PetriNetUnfolderBase]: For 361340/361352 co-relation queries the response was YES.
[2024-06-14 16:01:00,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41192 conditions, 5012 events. 3280/5012 cut-off events. For 361340/361352 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26785 event pairs, 682 based on Foata normal form. 14/5023 useless extension candidates. Maximal degree in co-relation 41063. Up to 4794 conditions per place. 
[2024-06-14 16:01:00,222 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 325 selfloop transitions, 67 changer transitions 0/395 dead transitions.
[2024-06-14 16:01:00,222 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 395 transitions, 6934 flow
[2024-06-14 16:01:00,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:01:00,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:01:00,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-14 16:01:00,223 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-14 16:01:00,223 INFO  L175             Difference]: Start difference. First operand has 263 places, 371 transitions, 5749 flow. Second operand 7 states and 116 transitions.
[2024-06-14 16:01:00,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 395 transitions, 6934 flow
[2024-06-14 16:01:00,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 395 transitions, 6748 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 16:01:00,821 INFO  L231             Difference]: Finished difference. Result has 264 places, 378 transitions, 5864 flow
[2024-06-14 16:01:00,821 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5563, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5864, PETRI_PLACES=264, PETRI_TRANSITIONS=378}
[2024-06-14 16:01:00,822 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places.
[2024-06-14 16:01:00,822 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 378 transitions, 5864 flow
[2024-06-14 16:01:00,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:00,822 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:00,822 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:01:00,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:01:00,822 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:00,823 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:00,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -1763733503, now seen corresponding path program 4 times
[2024-06-14 16:01:00,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:00,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482701316]
[2024-06-14 16:01:00,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:00,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:00,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:08,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:08,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:08,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482701316]
[2024-06-14 16:01:08,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482701316] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:08,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:08,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:01:08,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924311008]
[2024-06-14 16:01:08,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:08,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:01:08,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:08,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:01:08,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:01:09,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:09,170 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 378 transitions, 5864 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:09,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:09,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:09,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:10,964 INFO  L124   PetriNetUnfolderBase]: 3256/4984 cut-off events.
[2024-06-14 16:01:10,965 INFO  L125   PetriNetUnfolderBase]: For 368620/368620 co-relation queries the response was YES.
[2024-06-14 16:01:11,002 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40833 conditions, 4984 events. 3256/4984 cut-off events. For 368620/368620 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26722 event pairs, 724 based on Foata normal form. 6/4988 useless extension candidates. Maximal degree in co-relation 40702. Up to 4863 conditions per place. 
[2024-06-14 16:01:11,022 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 346 selfloop transitions, 46 changer transitions 0/395 dead transitions.
[2024-06-14 16:01:11,023 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 395 transitions, 6724 flow
[2024-06-14 16:01:11,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:01:11,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:01:11,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 16:01:11,024 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 16:01:11,024 INFO  L175             Difference]: Start difference. First operand has 264 places, 378 transitions, 5864 flow. Second operand 8 states and 128 transitions.
[2024-06-14 16:01:11,025 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 395 transitions, 6724 flow
[2024-06-14 16:01:11,601 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 395 transitions, 6466 flow, removed 97 selfloop flow, removed 3 redundant places.
[2024-06-14 16:01:11,606 INFO  L231             Difference]: Finished difference. Result has 269 places, 378 transitions, 5712 flow
[2024-06-14 16:01:11,607 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5606, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=269, PETRI_TRANSITIONS=378}
[2024-06-14 16:01:11,608 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places.
[2024-06-14 16:01:11,608 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 378 transitions, 5712 flow
[2024-06-14 16:01:11,608 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:11,608 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:11,608 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:01:11,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 16:01:11,609 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:01:11,609 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:11,609 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063606881, now seen corresponding path program 5 times
[2024-06-14 16:01:11,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:11,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231789169]
[2024-06-14 16:01:11,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:11,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:11,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:19,339 INFO  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:01:19,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:19,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231789169]
[2024-06-14 16:01:19,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231789169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:19,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:19,340 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:01:19,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479487407]
[2024-06-14 16:01:19,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:19,340 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:01:19,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:19,341 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:01:19,341 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:01:19,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:19,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 378 transitions, 5712 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:19,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:19,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:19,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:21,239 INFO  L124   PetriNetUnfolderBase]: 3232/4946 cut-off events.
[2024-06-14 16:01:21,239 INFO  L125   PetriNetUnfolderBase]: For 365016/365024 co-relation queries the response was YES.
[2024-06-14 16:01:21,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40044 conditions, 4946 events. 3232/4946 cut-off events. For 365016/365024 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26489 event pairs, 674 based on Foata normal form. 14/4958 useless extension candidates. Maximal degree in co-relation 39912. Up to 4736 conditions per place. 
[2024-06-14 16:01:21,299 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 334 selfloop transitions, 64 changer transitions 0/401 dead transitions.
[2024-06-14 16:01:21,300 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 401 transitions, 6612 flow
[2024-06-14 16:01:21,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:01:21,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:01:21,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-14 16:01:21,301 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4355400696864111
[2024-06-14 16:01:21,301 INFO  L175             Difference]: Start difference. First operand has 269 places, 378 transitions, 5712 flow. Second operand 7 states and 125 transitions.
[2024-06-14 16:01:21,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 401 transitions, 6612 flow
[2024-06-14 16:01:21,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 401 transitions, 6424 flow, removed 45 selfloop flow, removed 7 redundant places.
[2024-06-14 16:01:22,003 INFO  L231             Difference]: Finished difference. Result has 270 places, 379 transitions, 5725 flow
[2024-06-14 16:01:22,004 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5526, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5725, PETRI_PLACES=270, PETRI_TRANSITIONS=379}
[2024-06-14 16:01:22,004 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places.
[2024-06-14 16:01:22,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 379 transitions, 5725 flow
[2024-06-14 16:01:22,005 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:22,005 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:22,005 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:01:22,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 16:01:22,005 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:22,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:22,005 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092822025, now seen corresponding path program 5 times
[2024-06-14 16:01:22,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:22,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566620391]
[2024-06-14 16:01:22,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:22,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:22,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:29,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:29,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:29,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566620391]
[2024-06-14 16:01:29,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566620391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:29,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:29,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:29,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856164614]
[2024-06-14 16:01:29,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:29,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:29,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:29,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:29,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:29,302 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:29,302 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 379 transitions, 5725 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:29,302 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:29,302 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:29,303 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:31,182 INFO  L124   PetriNetUnfolderBase]: 3212/4918 cut-off events.
[2024-06-14 16:01:31,182 INFO  L125   PetriNetUnfolderBase]: For 366800/366802 co-relation queries the response was YES.
[2024-06-14 16:01:31,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39502 conditions, 4918 events. 3212/4918 cut-off events. For 366800/366802 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26233 event pairs, 621 based on Foata normal form. 14/4927 useless extension candidates. Maximal degree in co-relation 39368. Up to 4239 conditions per place. 
[2024-06-14 16:01:31,244 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 304 selfloop transitions, 99 changer transitions 0/406 dead transitions.
[2024-06-14 16:01:31,244 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 406 transitions, 6553 flow
[2024-06-14 16:01:31,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:01:31,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:01:31,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-14 16:01:31,247 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4115853658536585
[2024-06-14 16:01:31,247 INFO  L175             Difference]: Start difference. First operand has 270 places, 379 transitions, 5725 flow. Second operand 8 states and 135 transitions.
[2024-06-14 16:01:31,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 406 transitions, 6553 flow
[2024-06-14 16:01:31,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 406 transitions, 6422 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-06-14 16:01:31,939 INFO  L231             Difference]: Finished difference. Result has 272 places, 378 transitions, 5712 flow
[2024-06-14 16:01:31,940 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5510, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=272, PETRI_TRANSITIONS=378}
[2024-06-14 16:01:31,940 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places.
[2024-06-14 16:01:31,940 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 378 transitions, 5712 flow
[2024-06-14 16:01:31,940 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:31,940 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:31,941 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:01:31,941 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 16:01:31,941 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:31,941 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:31,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -205086924, now seen corresponding path program 4 times
[2024-06-14 16:01:31,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:31,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327172866]
[2024-06-14 16:01:31,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:31,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:31,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:42,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:42,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:42,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327172866]
[2024-06-14 16:01:42,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327172866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:42,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:42,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:01:42,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350568055]
[2024-06-14 16:01:42,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:42,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:01:42,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:42,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:01:42,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:01:42,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:42,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 378 transitions, 5712 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:42,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:42,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:42,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:44,203 INFO  L124   PetriNetUnfolderBase]: 3232/4943 cut-off events.
[2024-06-14 16:01:44,203 INFO  L125   PetriNetUnfolderBase]: For 347003/347003 co-relation queries the response was YES.
[2024-06-14 16:01:44,243 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39509 conditions, 4943 events. 3232/4943 cut-off events. For 347003/347003 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26347 event pairs, 633 based on Foata normal form. 4/4945 useless extension candidates. Maximal degree in co-relation 39375. Up to 4707 conditions per place. 
[2024-06-14 16:01:44,262 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 323 selfloop transitions, 76 changer transitions 0/402 dead transitions.
[2024-06-14 16:01:44,262 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 402 transitions, 6763 flow
[2024-06-14 16:01:44,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:01:44,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:01:44,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-14 16:01:44,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-14 16:01:44,263 INFO  L175             Difference]: Start difference. First operand has 272 places, 378 transitions, 5712 flow. Second operand 7 states and 119 transitions.
[2024-06-14 16:01:44,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 402 transitions, 6763 flow
[2024-06-14 16:01:44,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 402 transitions, 6543 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 16:01:44,833 INFO  L231             Difference]: Finished difference. Result has 273 places, 381 transitions, 5699 flow
[2024-06-14 16:01:44,833 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5492, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5699, PETRI_PLACES=273, PETRI_TRANSITIONS=381}
[2024-06-14 16:01:44,833 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places.
[2024-06-14 16:01:44,833 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 381 transitions, 5699 flow
[2024-06-14 16:01:44,834 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:44,834 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:44,834 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:01:44,834 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 16:01:44,834 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:44,834 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:44,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -210449898, now seen corresponding path program 5 times
[2024-06-14 16:01:44,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:44,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912279695]
[2024-06-14 16:01:44,835 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:44,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:44,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:56,100 INFO  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:01:56,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:56,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912279695]
[2024-06-14 16:01:56,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912279695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:56,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:56,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:01:56,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532571690]
[2024-06-14 16:01:56,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:56,101 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:01:56,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:56,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:01:56,101 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:01:56,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:01:56,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 381 transitions, 5699 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:56,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:56,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:01:56,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:57,899 INFO  L124   PetriNetUnfolderBase]: 3220/4931 cut-off events.
[2024-06-14 16:01:57,900 INFO  L125   PetriNetUnfolderBase]: For 348608/348616 co-relation queries the response was YES.
[2024-06-14 16:01:57,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39078 conditions, 4931 events. 3220/4931 cut-off events. For 348608/348616 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26414 event pairs, 636 based on Foata normal form. 12/4941 useless extension candidates. Maximal degree in co-relation 38943. Up to 4699 conditions per place. 
[2024-06-14 16:01:57,959 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 321 selfloop transitions, 81 changer transitions 0/405 dead transitions.
[2024-06-14 16:01:57,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 405 transitions, 6603 flow
[2024-06-14 16:01:57,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:01:57,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:01:57,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 16:01:57,961 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 16:01:57,961 INFO  L175             Difference]: Start difference. First operand has 273 places, 381 transitions, 5699 flow. Second operand 7 states and 123 transitions.
[2024-06-14 16:01:57,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 405 transitions, 6603 flow
[2024-06-14 16:01:58,611 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 405 transitions, 6335 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-14 16:01:58,616 INFO  L231             Difference]: Finished difference. Result has 275 places, 381 transitions, 5600 flow
[2024-06-14 16:01:58,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5431, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5600, PETRI_PLACES=275, PETRI_TRANSITIONS=381}
[2024-06-14 16:01:58,617 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places.
[2024-06-14 16:01:58,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 381 transitions, 5600 flow
[2024-06-14 16:01:58,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:58,617 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:58,617 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:01:58,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 16:01:58,618 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:58,618 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:58,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -486486059, now seen corresponding path program 1 times
[2024-06-14 16:01:58,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:58,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320960533]
[2024-06-14 16:01:58,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:58,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:58,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:07,188 INFO  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:02:07,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:07,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320960533]
[2024-06-14 16:02:07,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320960533] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:07,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:07,189 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:07,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800272024]
[2024-06-14 16:02:07,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:07,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:07,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:07,191 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:07,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:07,379 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:07,379 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 381 transitions, 5600 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:07,379 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:07,379 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:07,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:09,141 INFO  L124   PetriNetUnfolderBase]: 3238/4952 cut-off events.
[2024-06-14 16:02:09,141 INFO  L125   PetriNetUnfolderBase]: For 354578/354617 co-relation queries the response was YES.
[2024-06-14 16:02:09,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39333 conditions, 4952 events. 3238/4952 cut-off events. For 354578/354617 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 26433 event pairs, 655 based on Foata normal form. 32/4980 useless extension candidates. Maximal degree in co-relation 39197. Up to 4696 conditions per place. 
[2024-06-14 16:02:09,193 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 321 selfloop transitions, 89 changer transitions 0/413 dead transitions.
[2024-06-14 16:02:09,193 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 413 transitions, 7004 flow
[2024-06-14 16:02:09,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:02:09,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:02:09,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-14 16:02:09,196 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 16:02:09,196 INFO  L175             Difference]: Start difference. First operand has 275 places, 381 transitions, 5600 flow. Second operand 10 states and 155 transitions.
[2024-06-14 16:02:09,196 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 413 transitions, 7004 flow
[2024-06-14 16:02:09,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 413 transitions, 6775 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-14 16:02:09,600 INFO  L231             Difference]: Finished difference. Result has 278 places, 389 transitions, 5701 flow
[2024-06-14 16:02:09,600 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5371, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5701, PETRI_PLACES=278, PETRI_TRANSITIONS=389}
[2024-06-14 16:02:09,601 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 236 predicate places.
[2024-06-14 16:02:09,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 389 transitions, 5701 flow
[2024-06-14 16:02:09,601 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:09,601 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:09,601 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:02:09,601 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 16:02:09,601 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:09,602 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:09,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 477318202, now seen corresponding path program 1 times
[2024-06-14 16:02:09,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:09,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866779795]
[2024-06-14 16:02:09,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:09,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:09,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:17,871 INFO  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:02:17,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:17,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866779795]
[2024-06-14 16:02:17,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866779795] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:17,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:17,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:17,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014657223]
[2024-06-14 16:02:17,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:17,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:17,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:17,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:17,872 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:18,036 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:18,036 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 389 transitions, 5701 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:18,036 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:18,036 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:18,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:19,610 INFO  L124   PetriNetUnfolderBase]: 3298/5034 cut-off events.
[2024-06-14 16:02:19,611 INFO  L125   PetriNetUnfolderBase]: For 378827/378839 co-relation queries the response was YES.
[2024-06-14 16:02:19,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41131 conditions, 5034 events. 3298/5034 cut-off events. For 378827/378839 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26879 event pairs, 640 based on Foata normal form. 16/5047 useless extension candidates. Maximal degree in co-relation 40994. Up to 4618 conditions per place. 
[2024-06-14 16:02:19,676 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 316 selfloop transitions, 109 changer transitions 0/428 dead transitions.
[2024-06-14 16:02:19,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 428 transitions, 7227 flow
[2024-06-14 16:02:19,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:19,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:19,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-14 16:02:19,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 16:02:19,677 INFO  L175             Difference]: Start difference. First operand has 278 places, 389 transitions, 5701 flow. Second operand 9 states and 144 transitions.
[2024-06-14 16:02:19,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 428 transitions, 7227 flow
[2024-06-14 16:02:20,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 428 transitions, 7034 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-14 16:02:20,205 INFO  L231             Difference]: Finished difference. Result has 283 places, 406 transitions, 6181 flow
[2024-06-14 16:02:20,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5508, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6181, PETRI_PLACES=283, PETRI_TRANSITIONS=406}
[2024-06-14 16:02:20,206 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places.
[2024-06-14 16:02:20,206 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 406 transitions, 6181 flow
[2024-06-14 16:02:20,206 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:20,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:20,206 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:02:20,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 16:02:20,207 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:20,207 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:20,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 481037117, now seen corresponding path program 2 times
[2024-06-14 16:02:20,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:20,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396915629]
[2024-06-14 16:02:20,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:20,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:20,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:28,564 INFO  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:02:28,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:28,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396915629]
[2024-06-14 16:02:28,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396915629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:28,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:28,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:28,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91860144]
[2024-06-14 16:02:28,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:28,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:28,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:28,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:28,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:28,712 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:28,712 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 406 transitions, 6181 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:28,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:28,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:28,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:30,643 INFO  L124   PetriNetUnfolderBase]: 3514/5339 cut-off events.
[2024-06-14 16:02:30,644 INFO  L125   PetriNetUnfolderBase]: For 449490/449490 co-relation queries the response was YES.
[2024-06-14 16:02:30,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45800 conditions, 5339 events. 3514/5339 cut-off events. For 449490/449490 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28543 event pairs, 702 based on Foata normal form. 12/5349 useless extension candidates. Maximal degree in co-relation 45659. Up to 5040 conditions per place. 
[2024-06-14 16:02:30,705 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 384 selfloop transitions, 62 changer transitions 0/449 dead transitions.
[2024-06-14 16:02:30,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 449 transitions, 7791 flow
[2024-06-14 16:02:30,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:30,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:30,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:02:30,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 16:02:30,708 INFO  L175             Difference]: Start difference. First operand has 283 places, 406 transitions, 6181 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:02:30,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 449 transitions, 7791 flow
[2024-06-14 16:02:31,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 449 transitions, 7625 flow, removed 74 selfloop flow, removed 3 redundant places.
[2024-06-14 16:02:31,388 INFO  L231             Difference]: Finished difference. Result has 290 places, 425 transitions, 6547 flow
[2024-06-14 16:02:31,388 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6029, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6547, PETRI_PLACES=290, PETRI_TRANSITIONS=425}
[2024-06-14 16:02:31,388 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places.
[2024-06-14 16:02:31,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 290 places, 425 transitions, 6547 flow
[2024-06-14 16:02:31,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:31,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:31,389 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:02:31,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 16:02:31,389 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:31,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:31,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 481037272, now seen corresponding path program 2 times
[2024-06-14 16:02:31,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:31,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447104575]
[2024-06-14 16:02:31,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:31,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:31,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:39,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:39,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:39,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447104575]
[2024-06-14 16:02:39,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447104575] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:39,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:39,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:39,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432564539]
[2024-06-14 16:02:39,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:39,619 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:39,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:39,620 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:39,620 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:39,829 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:39,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 425 transitions, 6547 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:39,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:39,829 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:39,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:41,717 INFO  L124   PetriNetUnfolderBase]: 3582/5433 cut-off events.
[2024-06-14 16:02:41,717 INFO  L125   PetriNetUnfolderBase]: For 463048/463048 co-relation queries the response was YES.
[2024-06-14 16:02:41,768 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47942 conditions, 5433 events. 3582/5433 cut-off events. For 463048/463048 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29093 event pairs, 721 based on Foata normal form. 4/5435 useless extension candidates. Maximal degree in co-relation 47798. Up to 5265 conditions per place. 
[2024-06-14 16:02:41,906 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 397 selfloop transitions, 57 changer transitions 0/457 dead transitions.
[2024-06-14 16:02:41,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 457 transitions, 8076 flow
[2024-06-14 16:02:41,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:41,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:41,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-14 16:02:41,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-14 16:02:41,908 INFO  L175             Difference]: Start difference. First operand has 290 places, 425 transitions, 6547 flow. Second operand 9 states and 142 transitions.
[2024-06-14 16:02:41,908 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 457 transitions, 8076 flow
[2024-06-14 16:02:42,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 457 transitions, 7861 flow, removed 89 selfloop flow, removed 4 redundant places.
[2024-06-14 16:02:42,526 INFO  L231             Difference]: Finished difference. Result has 296 places, 436 transitions, 6750 flow
[2024-06-14 16:02:42,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6332, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6750, PETRI_PLACES=296, PETRI_TRANSITIONS=436}
[2024-06-14 16:02:42,527 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places.
[2024-06-14 16:02:42,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 296 places, 436 transitions, 6750 flow
[2024-06-14 16:02:42,527 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:42,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:42,528 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:02:42,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 16:02:42,528 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:42,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:42,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -38484900, now seen corresponding path program 3 times
[2024-06-14 16:02:42,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:42,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048358284]
[2024-06-14 16:02:42,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:42,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:42,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:50,432 INFO  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:02:50,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:50,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048358284]
[2024-06-14 16:02:50,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048358284] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:50,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:50,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:02:50,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148167316]
[2024-06-14 16:02:50,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:50,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:02:50,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:50,433 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:02:50,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:02:50,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:02:50,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 436 transitions, 6750 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:50,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:50,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:02:50,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:52,592 INFO  L124   PetriNetUnfolderBase]: 3638/5511 cut-off events.
[2024-06-14 16:02:52,592 INFO  L125   PetriNetUnfolderBase]: For 483212/483212 co-relation queries the response was YES.
[2024-06-14 16:02:52,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48957 conditions, 5511 events. 3638/5511 cut-off events. For 483212/483212 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29517 event pairs, 729 based on Foata normal form. 4/5513 useless extension candidates. Maximal degree in co-relation 48810. Up to 5367 conditions per place. 
[2024-06-14 16:02:52,674 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 416 selfloop transitions, 43 changer transitions 0/462 dead transitions.
[2024-06-14 16:02:52,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 462 transitions, 8097 flow
[2024-06-14 16:02:52,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:02:52,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:02:52,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-14 16:02:52,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 16:02:52,677 INFO  L175             Difference]: Start difference. First operand has 296 places, 436 transitions, 6750 flow. Second operand 8 states and 124 transitions.
[2024-06-14 16:02:52,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 462 transitions, 8097 flow
[2024-06-14 16:02:53,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 462 transitions, 7954 flow, removed 53 selfloop flow, removed 4 redundant places.
[2024-06-14 16:02:53,657 INFO  L231             Difference]: Finished difference. Result has 301 places, 444 transitions, 6948 flow
[2024-06-14 16:02:53,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6607, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6948, PETRI_PLACES=301, PETRI_TRANSITIONS=444}
[2024-06-14 16:02:53,658 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places.
[2024-06-14 16:02:53,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 444 transitions, 6948 flow
[2024-06-14 16:02:53,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:53,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:53,658 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:02:53,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 16:02:53,658 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:02:53,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:53,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063598790, now seen corresponding path program 4 times
[2024-06-14 16:02:53,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:53,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240599279]
[2024-06-14 16:02:53,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:53,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:53,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:01,031 INFO  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:03:01,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:01,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240599279]
[2024-06-14 16:03:01,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240599279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:01,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:01,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:01,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851202669]
[2024-06-14 16:03:01,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:01,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:01,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:01,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:01,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:01,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:01,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 444 transitions, 6948 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:01,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:01,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:01,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:03,191 INFO  L124   PetriNetUnfolderBase]: 3690/5578 cut-off events.
[2024-06-14 16:03:03,191 INFO  L125   PetriNetUnfolderBase]: For 505429/505437 co-relation queries the response was YES.
[2024-06-14 16:03:03,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50322 conditions, 5578 events. 3690/5578 cut-off events. For 505429/505437 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 29833 event pairs, 720 based on Foata normal form. 12/5588 useless extension candidates. Maximal degree in co-relation 50172. Up to 5267 conditions per place. 
[2024-06-14 16:03:03,262 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 389 selfloop transitions, 89 changer transitions 0/481 dead transitions.
[2024-06-14 16:03:03,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 481 transitions, 8571 flow
[2024-06-14 16:03:03,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:03,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:03,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 16:03:03,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-14 16:03:03,264 INFO  L175             Difference]: Start difference. First operand has 301 places, 444 transitions, 6948 flow. Second operand 8 states and 139 transitions.
[2024-06-14 16:03:03,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 481 transitions, 8571 flow
[2024-06-14 16:03:04,408 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 481 transitions, 8339 flow, removed 64 selfloop flow, removed 5 redundant places.
[2024-06-14 16:03:04,418 INFO  L231             Difference]: Finished difference. Result has 306 places, 455 transitions, 7282 flow
[2024-06-14 16:03:04,419 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6716, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7282, PETRI_PLACES=306, PETRI_TRANSITIONS=455}
[2024-06-14 16:03:04,419 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places.
[2024-06-14 16:03:04,419 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 455 transitions, 7282 flow
[2024-06-14 16:03:04,419 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:04,419 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:04,420 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:03:04,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 16:03:04,420 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:03:04,420 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:04,420 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063598945, now seen corresponding path program 3 times
[2024-06-14 16:03:04,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:04,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448944250]
[2024-06-14 16:03:04,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:04,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:04,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:13,134 INFO  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:03:13,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:13,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448944250]
[2024-06-14 16:03:13,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448944250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:13,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:13,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:03:13,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901338338]
[2024-06-14 16:03:13,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:13,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:03:13,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:13,144 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:03:13,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:03:13,291 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:13,291 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 455 transitions, 7282 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:13,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:13,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:13,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:15,456 INFO  L124   PetriNetUnfolderBase]: 3734/5640 cut-off events.
[2024-06-14 16:03:15,457 INFO  L125   PetriNetUnfolderBase]: For 531297/531305 co-relation queries the response was YES.
[2024-06-14 16:03:15,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51148 conditions, 5640 events. 3734/5640 cut-off events. For 531297/531305 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30232 event pairs, 723 based on Foata normal form. 16/5654 useless extension candidates. Maximal degree in co-relation 50997. Up to 5356 conditions per place. 
[2024-06-14 16:03:15,532 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 396 selfloop transitions, 99 changer transitions 0/498 dead transitions.
[2024-06-14 16:03:15,532 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 498 transitions, 8878 flow
[2024-06-14 16:03:15,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:15,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:15,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 16:03:15,534 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-14 16:03:15,535 INFO  L175             Difference]: Start difference. First operand has 306 places, 455 transitions, 7282 flow. Second operand 8 states and 146 transitions.
[2024-06-14 16:03:15,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 498 transitions, 8878 flow
[2024-06-14 16:03:16,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 498 transitions, 8731 flow, removed 68 selfloop flow, removed 2 redundant places.
[2024-06-14 16:03:16,507 INFO  L231             Difference]: Finished difference. Result has 314 places, 470 transitions, 7805 flow
[2024-06-14 16:03:16,507 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7135, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7805, PETRI_PLACES=314, PETRI_TRANSITIONS=470}
[2024-06-14 16:03:16,508 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 272 predicate places.
[2024-06-14 16:03:16,508 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 470 transitions, 7805 flow
[2024-06-14 16:03:16,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:16,508 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:16,508 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:03:16,509 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 16:03:16,509 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:03:16,509 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:16,509 INFO  L85        PathProgramCache]: Analyzing trace with hash -1162515711, now seen corresponding path program 1 times
[2024-06-14 16:03:16,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:16,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394105574]
[2024-06-14 16:03:16,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:16,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:16,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:25,017 INFO  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:03:25,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:25,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394105574]
[2024-06-14 16:03:25,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394105574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:25,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:25,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:03:25,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343607674]
[2024-06-14 16:03:25,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:25,019 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:03:25,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:25,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:03:25,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:03:25,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:25,170 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 470 transitions, 7805 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:25,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:25,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:25,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:27,223 INFO  L124   PetriNetUnfolderBase]: 3760/5676 cut-off events.
[2024-06-14 16:03:27,223 INFO  L125   PetriNetUnfolderBase]: For 554925/554933 co-relation queries the response was YES.
[2024-06-14 16:03:27,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52834 conditions, 5676 events. 3760/5676 cut-off events. For 554925/554933 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 30337 event pairs, 683 based on Foata normal form. 10/5684 useless extension candidates. Maximal degree in co-relation 52679. Up to 5367 conditions per place. 
[2024-06-14 16:03:27,296 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 425 selfloop transitions, 82 changer transitions 0/510 dead transitions.
[2024-06-14 16:03:27,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 510 transitions, 9241 flow
[2024-06-14 16:03:27,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:27,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:27,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-14 16:03:27,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-14 16:03:27,298 INFO  L175             Difference]: Start difference. First operand has 314 places, 470 transitions, 7805 flow. Second operand 8 states and 133 transitions.
[2024-06-14 16:03:27,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 510 transitions, 9241 flow
[2024-06-14 16:03:28,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 510 transitions, 9018 flow, removed 94 selfloop flow, removed 3 redundant places.
[2024-06-14 16:03:28,225 INFO  L231             Difference]: Finished difference. Result has 321 places, 484 transitions, 8008 flow
[2024-06-14 16:03:28,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7582, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8008, PETRI_PLACES=321, PETRI_TRANSITIONS=484}
[2024-06-14 16:03:28,226 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places.
[2024-06-14 16:03:28,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 484 transitions, 8008 flow
[2024-06-14 16:03:28,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:28,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:28,227 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:03:28,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 16:03:28,227 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:03:28,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:28,227 INFO  L85        PathProgramCache]: Analyzing trace with hash -1156801791, now seen corresponding path program 2 times
[2024-06-14 16:03:28,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:28,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806392984]
[2024-06-14 16:03:28,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:28,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:28,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:36,195 INFO  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:03:36,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:36,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806392984]
[2024-06-14 16:03:36,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806392984] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:36,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:36,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:03:36,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777067892]
[2024-06-14 16:03:36,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:36,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:03:36,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:36,197 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:03:36,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:03:36,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:36,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 484 transitions, 8008 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:36,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:36,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:36,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:38,674 INFO  L124   PetriNetUnfolderBase]: 3770/5692 cut-off events.
[2024-06-14 16:03:38,675 INFO  L125   PetriNetUnfolderBase]: For 573365/573373 co-relation queries the response was YES.
[2024-06-14 16:03:38,722 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53939 conditions, 5692 events. 3770/5692 cut-off events. For 573365/573373 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30501 event pairs, 696 based on Foata normal form. 10/5700 useless extension candidates. Maximal degree in co-relation 53780. Up to 5490 conditions per place. 
[2024-06-14 16:03:38,744 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 439 selfloop transitions, 67 changer transitions 0/509 dead transitions.
[2024-06-14 16:03:38,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 509 transitions, 9178 flow
[2024-06-14 16:03:38,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:38,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:38,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-14 16:03:38,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-14 16:03:38,746 INFO  L175             Difference]: Start difference. First operand has 321 places, 484 transitions, 8008 flow. Second operand 8 states and 127 transitions.
[2024-06-14 16:03:38,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 509 transitions, 9178 flow
[2024-06-14 16:03:39,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 509 transitions, 9053 flow, removed 58 selfloop flow, removed 2 redundant places.
[2024-06-14 16:03:39,650 INFO  L231             Difference]: Finished difference. Result has 327 places, 488 transitions, 8111 flow
[2024-06-14 16:03:39,650 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7909, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8111, PETRI_PLACES=327, PETRI_TRANSITIONS=488}
[2024-06-14 16:03:39,650 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places.
[2024-06-14 16:03:39,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 488 transitions, 8111 flow
[2024-06-14 16:03:39,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:39,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:39,651 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:03:39,651 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-14 16:03:39,653 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:39,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:39,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 864570977, now seen corresponding path program 1 times
[2024-06-14 16:03:39,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:39,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229040059]
[2024-06-14 16:03:39,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:39,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:39,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:50,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:50,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:50,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229040059]
[2024-06-14 16:03:50,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229040059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:50,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:50,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:03:50,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799052194]
[2024-06-14 16:03:50,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:50,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:03:50,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:50,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:03:50,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:03:50,652 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:03:50,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 488 transitions, 8111 flow. Second operand  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:50,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:50,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:03:50,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:52,851 INFO  L124   PetriNetUnfolderBase]: 3778/5707 cut-off events.
[2024-06-14 16:03:52,851 INFO  L125   PetriNetUnfolderBase]: For 587829/587837 co-relation queries the response was YES.
[2024-06-14 16:03:52,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54274 conditions, 5707 events. 3778/5707 cut-off events. For 587829/587837 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30604 event pairs, 576 based on Foata normal form. 10/5715 useless extension candidates. Maximal degree in co-relation 54113. Up to 5410 conditions per place. 
[2024-06-14 16:03:52,922 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 453 selfloop transitions, 62 changer transitions 0/518 dead transitions.
[2024-06-14 16:03:52,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 518 transitions, 9461 flow
[2024-06-14 16:03:52,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:52,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:52,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-14 16:03:52,923 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-14 16:03:52,923 INFO  L175             Difference]: Start difference. First operand has 327 places, 488 transitions, 8111 flow. Second operand 8 states and 131 transitions.
[2024-06-14 16:03:52,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 518 transitions, 9461 flow
[2024-06-14 16:03:53,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 518 transitions, 9305 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-14 16:03:53,840 INFO  L231             Difference]: Finished difference. Result has 330 places, 492 transitions, 8177 flow
[2024-06-14 16:03:53,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7955, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8177, PETRI_PLACES=330, PETRI_TRANSITIONS=492}
[2024-06-14 16:03:53,840 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 288 predicate places.
[2024-06-14 16:03:53,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 492 transitions, 8177 flow
[2024-06-14 16:03:53,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:53,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:53,841 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:03:53,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-14 16:03:53,841 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:53,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:53,842 INFO  L85        PathProgramCache]: Analyzing trace with hash 864809987, now seen corresponding path program 2 times
[2024-06-14 16:03:53,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:53,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136150837]
[2024-06-14 16:03:53,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:53,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:53,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:05,116 INFO  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:04:05,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:05,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136150837]
[2024-06-14 16:04:05,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136150837] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:05,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:05,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:05,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129697653]
[2024-06-14 16:04:05,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:05,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:05,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:05,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:05,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:05,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:05,249 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 492 transitions, 8177 flow. Second operand  has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:05,249 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:05,249 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:05,249 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:07,449 INFO  L124   PetriNetUnfolderBase]: 3786/5719 cut-off events.
[2024-06-14 16:04:07,449 INFO  L125   PetriNetUnfolderBase]: For 603824/603832 co-relation queries the response was YES.
[2024-06-14 16:04:07,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54660 conditions, 5719 events. 3786/5719 cut-off events. For 603824/603832 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30791 event pairs, 704 based on Foata normal form. 10/5727 useless extension candidates. Maximal degree in co-relation 54498. Up to 5514 conditions per place. 
[2024-06-14 16:04:07,534 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 444 selfloop transitions, 68 changer transitions 0/515 dead transitions.
[2024-06-14 16:04:07,535 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 515 transitions, 9321 flow
[2024-06-14 16:04:07,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:07,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:07,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-14 16:04:07,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-14 16:04:07,537 INFO  L175             Difference]: Start difference. First operand has 330 places, 492 transitions, 8177 flow. Second operand 8 states and 127 transitions.
[2024-06-14 16:04:07,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 515 transitions, 9321 flow
[2024-06-14 16:04:08,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 515 transitions, 9171 flow, removed 44 selfloop flow, removed 4 redundant places.
[2024-06-14 16:04:08,433 INFO  L231             Difference]: Finished difference. Result has 334 places, 494 transitions, 8220 flow
[2024-06-14 16:04:08,434 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8051, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8220, PETRI_PLACES=334, PETRI_TRANSITIONS=494}
[2024-06-14 16:04:08,434 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places.
[2024-06-14 16:04:08,434 INFO  L495      AbstractCegarLoop]: Abstraction has has 334 places, 494 transitions, 8220 flow
[2024-06-14 16:04:08,434 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:08,434 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:08,434 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:04:08,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-14 16:04:08,435 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:08,435 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:08,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -210946559, now seen corresponding path program 3 times
[2024-06-14 16:04:08,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:08,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403941303]
[2024-06-14 16:04:08,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:08,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:08,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:16,633 INFO  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:04:16,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:16,634 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403941303]
[2024-06-14 16:04:16,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403941303] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:16,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:16,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:16,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432993414]
[2024-06-14 16:04:16,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:16,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:16,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:16,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:16,635 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:16,775 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:16,776 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 494 transitions, 8220 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:16,776 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:16,776 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:16,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:18,855 INFO  L124   PetriNetUnfolderBase]: 3820/5762 cut-off events.
[2024-06-14 16:04:18,855 INFO  L125   PetriNetUnfolderBase]: For 628293/628293 co-relation queries the response was YES.
[2024-06-14 16:04:18,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55582 conditions, 5762 events. 3820/5762 cut-off events. For 628293/628293 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30906 event pairs, 694 based on Foata normal form. 2/5762 useless extension candidates. Maximal degree in co-relation 55418. Up to 5274 conditions per place. 
[2024-06-14 16:04:18,937 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 411 selfloop transitions, 115 changer transitions 0/529 dead transitions.
[2024-06-14 16:04:18,938 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 529 transitions, 9886 flow
[2024-06-14 16:04:18,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:18,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:18,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-14 16:04:18,939 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-14 16:04:18,939 INFO  L175             Difference]: Start difference. First operand has 334 places, 494 transitions, 8220 flow. Second operand 8 states and 134 transitions.
[2024-06-14 16:04:18,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 529 transitions, 9886 flow
[2024-06-14 16:04:20,124 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 529 transitions, 9737 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-14 16:04:20,132 INFO  L231             Difference]: Finished difference. Result has 336 places, 503 transitions, 8537 flow
[2024-06-14 16:04:20,132 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8537, PETRI_PLACES=336, PETRI_TRANSITIONS=503}
[2024-06-14 16:04:20,132 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 294 predicate places.
[2024-06-14 16:04:20,132 INFO  L495      AbstractCegarLoop]: Abstraction has has 336 places, 503 transitions, 8537 flow
[2024-06-14 16:04:20,132 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:20,133 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:20,133 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:04:20,133 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-14 16:04:20,133 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:20,133 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:20,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 983020799, now seen corresponding path program 1 times
[2024-06-14 16:04:20,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:20,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892267780]
[2024-06-14 16:04:20,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:20,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:20,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:28,111 INFO  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:04:28,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:28,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892267780]
[2024-06-14 16:04:28,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892267780] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:28,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:28,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:28,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807539296]
[2024-06-14 16:04:28,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:28,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:28,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:28,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:28,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:28,377 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:28,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 503 transitions, 8537 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:28,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:28,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:28,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:30,532 INFO  L124   PetriNetUnfolderBase]: 3825/5768 cut-off events.
[2024-06-14 16:04:30,532 INFO  L125   PetriNetUnfolderBase]: For 643854/643862 co-relation queries the response was YES.
[2024-06-14 16:04:30,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56380 conditions, 5768 events. 3825/5768 cut-off events. For 643854/643862 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30969 event pairs, 731 based on Foata normal form. 9/5775 useless extension candidates. Maximal degree in co-relation 56215. Up to 5667 conditions per place. 
[2024-06-14 16:04:30,610 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 481 selfloop transitions, 40 changer transitions 0/524 dead transitions.
[2024-06-14 16:04:30,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 524 transitions, 9718 flow
[2024-06-14 16:04:30,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:30,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:30,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-14 16:04:30,611 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3719512195121951
[2024-06-14 16:04:30,611 INFO  L175             Difference]: Start difference. First operand has 336 places, 503 transitions, 8537 flow. Second operand 8 states and 122 transitions.
[2024-06-14 16:04:30,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 524 transitions, 9718 flow
[2024-06-14 16:04:31,706 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 524 transitions, 9536 flow, removed 64 selfloop flow, removed 3 redundant places.
[2024-06-14 16:04:31,713 INFO  L231             Difference]: Finished difference. Result has 341 places, 506 transitions, 8522 flow
[2024-06-14 16:04:31,714 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8355, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8522, PETRI_PLACES=341, PETRI_TRANSITIONS=506}
[2024-06-14 16:04:31,714 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 299 predicate places.
[2024-06-14 16:04:31,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 506 transitions, 8522 flow
[2024-06-14 16:04:31,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:31,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:31,714 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:04:31,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-14 16:04:31,715 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:31,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:31,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -2127888347, now seen corresponding path program 1 times
[2024-06-14 16:04:31,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:31,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559757970]
[2024-06-14 16:04:31,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:31,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:31,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:39,772 INFO  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:04:39,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:39,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559757970]
[2024-06-14 16:04:39,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559757970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:39,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:39,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:39,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934813050]
[2024-06-14 16:04:39,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:39,773 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:39,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:39,773 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:39,774 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:39,868 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:39,869 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 506 transitions, 8522 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:39,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:39,869 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:39,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:42,157 INFO  L124   PetriNetUnfolderBase]: 3867/5826 cut-off events.
[2024-06-14 16:04:42,157 INFO  L125   PetriNetUnfolderBase]: For 671124/671132 co-relation queries the response was YES.
[2024-06-14 16:04:42,210 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57263 conditions, 5826 events. 3867/5826 cut-off events. For 671124/671132 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31317 event pairs, 733 based on Foata normal form. 10/5834 useless extension candidates. Maximal degree in co-relation 57096. Up to 5656 conditions per place. 
[2024-06-14 16:04:42,233 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 463 selfloop transitions, 73 changer transitions 0/539 dead transitions.
[2024-06-14 16:04:42,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 539 transitions, 10202 flow
[2024-06-14 16:04:42,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:42,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:42,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions.
[2024-06-14 16:04:42,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39634146341463417
[2024-06-14 16:04:42,236 INFO  L175             Difference]: Start difference. First operand has 341 places, 506 transitions, 8522 flow. Second operand 8 states and 130 transitions.
[2024-06-14 16:04:42,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 539 transitions, 10202 flow
[2024-06-14 16:04:43,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 539 transitions, 10076 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-14 16:04:43,475 INFO  L231             Difference]: Finished difference. Result has 344 places, 518 transitions, 8978 flow
[2024-06-14 16:04:43,475 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8396, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8978, PETRI_PLACES=344, PETRI_TRANSITIONS=518}
[2024-06-14 16:04:43,475 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 302 predicate places.
[2024-06-14 16:04:43,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 344 places, 518 transitions, 8978 flow
[2024-06-14 16:04:43,476 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:43,476 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:43,476 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:04:43,476 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-14 16:04:43,476 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:43,476 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:43,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -1046926011, now seen corresponding path program 4 times
[2024-06-14 16:04:43,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:43,477 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774719325]
[2024-06-14 16:04:43,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:43,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:43,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:51,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:04:51,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:51,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774719325]
[2024-06-14 16:04:51,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774719325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:51,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:51,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:51,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459435497]
[2024-06-14 16:04:51,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:51,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:51,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:51,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:51,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:51,619 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:04:51,619 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 518 transitions, 8978 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:51,619 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:51,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:04:51,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:53,878 INFO  L124   PetriNetUnfolderBase]: 3885/5852 cut-off events.
[2024-06-14 16:04:53,878 INFO  L125   PetriNetUnfolderBase]: For 695743/695743 co-relation queries the response was YES.
[2024-06-14 16:04:53,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58181 conditions, 5852 events. 3885/5852 cut-off events. For 695743/695743 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 31404 event pairs, 691 based on Foata normal form. 2/5852 useless extension candidates. Maximal degree in co-relation 58012. Up to 5358 conditions per place. 
[2024-06-14 16:04:53,972 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 415 selfloop transitions, 129 changer transitions 0/547 dead transitions.
[2024-06-14 16:04:53,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 547 transitions, 10562 flow
[2024-06-14 16:04:53,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:53,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:53,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-14 16:04:53,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-14 16:04:53,974 INFO  L175             Difference]: Start difference. First operand has 344 places, 518 transitions, 8978 flow. Second operand 8 states and 131 transitions.
[2024-06-14 16:04:53,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 547 transitions, 10562 flow
[2024-06-14 16:04:55,398 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 547 transitions, 10379 flow, removed 66 selfloop flow, removed 4 redundant places.
[2024-06-14 16:04:55,405 INFO  L231             Difference]: Finished difference. Result has 348 places, 524 transitions, 9165 flow
[2024-06-14 16:04:55,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8795, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9165, PETRI_PLACES=348, PETRI_TRANSITIONS=524}
[2024-06-14 16:04:55,406 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 306 predicate places.
[2024-06-14 16:04:55,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 348 places, 524 transitions, 9165 flow
[2024-06-14 16:04:55,406 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:55,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:55,406 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:04:55,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-14 16:04:55,407 INFO  L420      AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:55,407 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:55,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 1160152505, now seen corresponding path program 2 times
[2024-06-14 16:04:55,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:55,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138139911]
[2024-06-14 16:04:55,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:55,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:55,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:04,146 INFO  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:05:04,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:04,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138139911]
[2024-06-14 16:05:04,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138139911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:04,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:04,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:04,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673265365]
[2024-06-14 16:05:04,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:04,147 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:04,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:04,148 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:04,148 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:04,308 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:04,308 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 524 transitions, 9165 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:04,308 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:04,308 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:04,308 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:06,563 INFO  L124   PetriNetUnfolderBase]: 3903/5876 cut-off events.
[2024-06-14 16:05:06,564 INFO  L125   PetriNetUnfolderBase]: For 715200/715208 co-relation queries the response was YES.
[2024-06-14 16:05:06,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59001 conditions, 5876 events. 3903/5876 cut-off events. For 715200/715208 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 31584 event pairs, 733 based on Foata normal form. 10/5884 useless extension candidates. Maximal degree in co-relation 58830. Up to 5765 conditions per place. 
[2024-06-14 16:05:06,643 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 491 selfloop transitions, 54 changer transitions 0/548 dead transitions.
[2024-06-14 16:05:06,643 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 548 transitions, 10646 flow
[2024-06-14 16:05:06,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:05:06,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:05:06,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 16:05:06,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 16:05:06,646 INFO  L175             Difference]: Start difference. First operand has 348 places, 524 transitions, 9165 flow. Second operand 8 states and 128 transitions.
[2024-06-14 16:05:06,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 548 transitions, 10646 flow
[2024-06-14 16:05:08,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 548 transitions, 10463 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-14 16:05:08,198 INFO  L231             Difference]: Finished difference. Result has 353 places, 530 transitions, 9279 flow
[2024-06-14 16:05:08,198 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8982, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9279, PETRI_PLACES=353, PETRI_TRANSITIONS=530}
[2024-06-14 16:05:08,198 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 311 predicate places.
[2024-06-14 16:05:08,198 INFO  L495      AbstractCegarLoop]: Abstraction has has 353 places, 530 transitions, 9279 flow
[2024-06-14 16:05:08,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:08,199 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:08,199 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:05:08,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-14 16:05:08,199 INFO  L420      AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:08,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:08,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 1160152319, now seen corresponding path program 2 times
[2024-06-14 16:05:08,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:08,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38277159]
[2024-06-14 16:05:08,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:08,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:08,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:16,282 INFO  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:05:16,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:16,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38277159]
[2024-06-14 16:05:16,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38277159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:16,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:16,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:16,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81189067]
[2024-06-14 16:05:16,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:16,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:16,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:16,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:16,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:16,415 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:16,416 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 530 transitions, 9279 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:16,416 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:16,416 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:16,416 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:18,567 INFO  L124   PetriNetUnfolderBase]: 3908/5883 cut-off events.
[2024-06-14 16:05:18,568 INFO  L125   PetriNetUnfolderBase]: For 728159/728167 co-relation queries the response was YES.
[2024-06-14 16:05:18,631 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59084 conditions, 5883 events. 3908/5883 cut-off events. For 728159/728167 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31622 event pairs, 730 based on Foata normal form. 9/5890 useless extension candidates. Maximal degree in co-relation 58911. Up to 5815 conditions per place. 
[2024-06-14 16:05:18,658 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 517 selfloop transitions, 28 changer transitions 0/548 dead transitions.
[2024-06-14 16:05:18,659 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 548 transitions, 10500 flow
[2024-06-14 16:05:18,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:05:18,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:05:18,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions.
[2024-06-14 16:05:18,661 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3597560975609756
[2024-06-14 16:05:18,661 INFO  L175             Difference]: Start difference. First operand has 353 places, 530 transitions, 9279 flow. Second operand 8 states and 118 transitions.
[2024-06-14 16:05:18,661 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 548 transitions, 10500 flow
[2024-06-14 16:05:20,312 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 548 transitions, 10312 flow, removed 48 selfloop flow, removed 5 redundant places.
[2024-06-14 16:05:20,319 INFO  L231             Difference]: Finished difference. Result has 356 places, 533 transitions, 9240 flow
[2024-06-14 16:05:20,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9091, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9240, PETRI_PLACES=356, PETRI_TRANSITIONS=533}
[2024-06-14 16:05:20,320 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 314 predicate places.
[2024-06-14 16:05:20,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 356 places, 533 transitions, 9240 flow
[2024-06-14 16:05:20,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:20,320 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:20,320 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:05:20,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-14 16:05:20,321 INFO  L420      AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:20,321 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:20,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 1160032163, now seen corresponding path program 5 times
[2024-06-14 16:05:20,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:20,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471508512]
[2024-06-14 16:05:20,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:20,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:20,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:28,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:28,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:28,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471508512]
[2024-06-14 16:05:28,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471508512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:28,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:28,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:28,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662145300]
[2024-06-14 16:05:28,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:28,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:28,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:28,827 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:28,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:28,914 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:28,915 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 533 transitions, 9240 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:28,915 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:28,915 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:28,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:31,076 INFO  L124   PetriNetUnfolderBase]: 3902/5876 cut-off events.
[2024-06-14 16:05:31,076 INFO  L125   PetriNetUnfolderBase]: For 740091/740091 co-relation queries the response was YES.
[2024-06-14 16:05:31,133 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58841 conditions, 5876 events. 3902/5876 cut-off events. For 740091/740091 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31559 event pairs, 705 based on Foata normal form. 2/5876 useless extension candidates. Maximal degree in co-relation 58667. Up to 5675 conditions per place. 
[2024-06-14 16:05:31,159 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 476 selfloop transitions, 70 changer transitions 0/549 dead transitions.
[2024-06-14 16:05:31,159 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 549 transitions, 10388 flow
[2024-06-14 16:05:31,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:05:31,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:05:31,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-14 16:05:31,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-14 16:05:31,160 INFO  L175             Difference]: Start difference. First operand has 356 places, 533 transitions, 9240 flow. Second operand 8 states and 123 transitions.
[2024-06-14 16:05:31,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 549 transitions, 10388 flow
[2024-06-14 16:05:32,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 549 transitions, 10258 flow, removed 39 selfloop flow, removed 6 redundant places.
[2024-06-14 16:05:32,847 INFO  L231             Difference]: Finished difference. Result has 358 places, 533 transitions, 9256 flow
[2024-06-14 16:05:32,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9110, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9256, PETRI_PLACES=358, PETRI_TRANSITIONS=533}
[2024-06-14 16:05:32,847 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 316 predicate places.
[2024-06-14 16:05:32,848 INFO  L495      AbstractCegarLoop]: Abstraction has has 358 places, 533 transitions, 9256 flow
[2024-06-14 16:05:32,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:32,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:32,848 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:05:32,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-14 16:05:32,848 INFO  L420      AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:32,849 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:32,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 1160152133, now seen corresponding path program 6 times
[2024-06-14 16:05:32,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:32,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301646174]
[2024-06-14 16:05:32,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:32,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:32,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:40,725 INFO  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:05:40,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:40,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301646174]
[2024-06-14 16:05:40,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301646174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:40,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:40,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:40,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628503818]
[2024-06-14 16:05:40,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:40,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:40,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:40,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:40,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:40,849 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 16:05:40,850 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 533 transitions, 9256 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:40,850 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:40,850 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 16:05:40,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:43,005 INFO  L124   PetriNetUnfolderBase]: 3920/5901 cut-off events.
[2024-06-14 16:05:43,005 INFO  L125   PetriNetUnfolderBase]: For 760986/760986 co-relation queries the response was YES.
[2024-06-14 16:05:43,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59370 conditions, 5901 events. 3920/5901 cut-off events. For 760986/760986 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 31717 event pairs, 705 based on Foata normal form. 2/5901 useless extension candidates. Maximal degree in co-relation 59195. Up to 5679 conditions per place. 
[2024-06-14 16:05:43,100 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 474 selfloop transitions, 80 changer transitions 0/557 dead transitions.
[2024-06-14 16:05:43,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 557 transitions, 10700 flow
[2024-06-14 16:05:43,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:05:43,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:05:43,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-14 16:05:43,104 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38414634146341464
[2024-06-14 16:05:43,104 INFO  L175             Difference]: Start difference. First operand has 358 places, 533 transitions, 9256 flow. Second operand 8 states and 126 transitions.
[2024-06-14 16:05:43,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 557 transitions, 10700 flow
[2024-06-14 16:05:44,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 557 transitions, 10575 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 16:05:44,673 INFO  L231             Difference]: Finished difference. Result has 363 places, 539 transitions, 9438 flow
[2024-06-14 16:05:44,673 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9131, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9438, PETRI_PLACES=363, PETRI_TRANSITIONS=539}
[2024-06-14 16:05:44,674 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 321 predicate places.
[2024-06-14 16:05:44,674 INFO  L495      AbstractCegarLoop]: Abstraction has has 363 places, 539 transitions, 9438 flow
[2024-06-14 16:05:44,674 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:44,674 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:44,674 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:05:44,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85
[2024-06-14 16:05:44,675 INFO  L420      AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:44,675 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:44,675 INFO  L85        PathProgramCache]: Analyzing trace with hash -869556969, now seen corresponding path program 3 times
[2024-06-14 16:05:44,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:44,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869743111]
[2024-06-14 16:05:44,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:44,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:44,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15